Euler Problem 216:
Brute force rješenje, traje oko 25 minuta :( .
count = 0; For[i = 2, i <= 50000000, i++, ss = 2*i^2 - 1; If[PrimeQ[ss], count++]]; count
Brute force rješenje, traje oko 25 minuta :( .
count = 0; For[i = 2, i <= 50000000, i++, ss = 2*i^2 - 1; If[PrimeQ[ss], count++]]; count