Find squares n where n+1 is prime: Difference between revisions

m
Line 105:
isintegersquarebeforeprime(n) = isqrt(n)^2 == n && isprime(n + 1)
 
foreach(p -> print(lpad(last(p), 5)), filter(isintegersquarebeforeprime, 1:100001000))
</lang>{{out}}<pre> 1 4 16 36 100 196 256 400 576 676 1296 1600 2916 3136 4356 5476 7056 8100 8836</pre>
 
=={{header|PARI/GP}}==
4,103

edits