Posts by Jose • 1 point
1 post
-
-1
votes4
answers673
viewsA: Large integers and cousins
function primosAte(n) { var i, j; var prime = new Array(n); for (i = 2; i < n ; i++) prime[i] = true; for (i = 2; i * i < n ; i++) { if (prime[i]) { for (j = 0; i * i + i * j < n ; j++) {…
javascriptanswered Jose 1