Initial data commit

Task/AKS-test-for-primes/JavaScript/aks-test-for-primes-1.js

@@ -0,0 +1,79 @@
+var i, p, pascal, primerow, primes, show, _i;
+
+pascal = function() {
+  var a;
+  a = [];
+  return function() {
+    var b, i;
+    if (a.length === 0) {
+      return a = [1];
+    } else {
+      b = (function() {
+        var _i, _ref, _results;
+        _results = [];
+        for (i = _i = 0, _ref = a.length - 1; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
+          _results.push(a[i] + a[i + 1]);
+        }
+        return _results;
+      })();
+      return a = [1].concat(b).concat([1]);
+    }
+  };
+};
+
+show = function(a) {
+  var degree, i, sgn, show_x, str, _i, _ref;
+  show_x = function(e) {
+    switch (e) {
+      case 0:
+        return "";
+      case 1:
+        return "x";
+      default:
+        return "x^" + e;
+    }
+  };
+  degree = a.length - 1;
+  str = "(x - 1)^" + degree + " =";
+  sgn = 1;
+  for (i = _i = 0, _ref = a.length; 0 <= _ref ? _i < _ref : _i > _ref; i = 0 <= _ref ? ++_i : --_i) {
+    str += ' ' + (sgn > 0 ? "+" : "-") + ' ' + a[i] + show_x(degree - i);
+    sgn = -sgn;
+  }
+  return str;
+};
+
+primerow = function(row) {
+  var degree;
+  degree = row.length - 1;
+  return row.slice(1, degree).every(function(x) {
+    return x % degree === 0;
+  });
+};
+
+p = pascal();
+
+for (i = _i = 0; _i <= 7; i = ++_i) {
+  console.log(show(p()));
+}
+
+p = pascal();
+
+p();
+
+p();
+
+primes = (function() {
+  var _j, _results;
+  _results = [];
+  for (i = _j = 1; _j <= 49; i = ++_j) {
+    if (primerow(p())) {
+      _results.push(i + 1);
+    }
+  }
+  return _results;
+})();
+
+console.log("");
+
+console.log("The primes upto 50 are: " + primes);

Task/AKS-test-for-primes/JavaScript/aks-test-for-primes-2.js

@@ -0,0 +1,23 @@
+function pascal(n) {
+	var cs = []; if (n) while (n--) coef(); return coef
+	function coef() {
+		if (cs.length === 0) return cs = [1];
+		for (var t=[1,1], i=cs.length-1; i; i-=1) t.splice( 1, 0, cs[i-1]+cs[i] ); return cs = t
+	}
+}
+
+function show(cs) {
+	for (var s='', sgn=true, i=0, deg=cs.length-1; i<=deg; sgn=!sgn, i+=1) {
+		s += ' ' + (sgn ? '+' : '-') + cs[i] + (e => e==0 ? '' : e==1 ? 'x' : 'x<sup>' + e + '</sup>')(deg-i)
+	}
+	return '(x-1)<sup>' + deg + '</sup> =' + s;
+}
+
+function isPrime(cs) {
+	var deg=cs.length-1; return cs.slice(1, deg).every( function(c) { return c % deg === 0 } )
+}
+
+var coef=pascal(); for (var i=0; i<=7; i+=1) document.write(show(coef()), '<br>')
+
+document.write('<br>Primes: ');
+for (var coef=pascal(2), n=2; n<=50; n+=1) if (isPrime(coef())) document.write(' ', n)

Task/AKS-test-for-primes/JavaScript/aks-test-for-primes-3.js

@@ -0,0 +1,22 @@
+function coef(n) {
+ 	for (var c=[1], i=0; i<n; c[0]=-c[0], i+=1) {
+		c[i+1]=1; for (var j=i; j; j-=1) c[j] = c[j-1]-c[j]		
+	}
+	return c
+}
+
+function show(cs)	{
+	var s='', n=cs.length-1
+	do s += (cs[n]>0 ? ' +' : ' ') + cs[n] + (n==0 ? '' : n==1 ? 'x' :'x<sup>'+n+'</sup>'); while (n--)
+	return s
+}
+
+function isPrime(n) {
+	var cs=coef(n), i=n-1; while (i-- && cs[i]%n == 0);
+	return i < 1
+}
+
+for (var n=0; n<=7; n++) document.write('(x-1)<sup>',n,'</sup> = ', show(coef(n)), '<br>')
+
+document.write('<br>Primes: ');
+for (var n=2; n<=50; n++) if (isPrime(n)) document.write(' ', n)