Find squares n where n+1 is prime: Difference between revisions
Content added Content deleted
Line 105: | Line 105: | ||
isintegersquarebeforeprime(n) = isqrt(n)^2 == n && isprime(n + 1) |
isintegersquarebeforeprime(n) = isqrt(n)^2 == n && isprime(n + 1) |
||
foreach(p -> print(lpad(last(p), 5)), filter(isintegersquarebeforeprime, 1: |
foreach(p -> print(lpad(last(p), 5)), filter(isintegersquarebeforeprime, 1:1000)) |
||
</lang>{{out}}<pre> 1 4 16 36 100 196 256 400 576 676 |
</lang>{{out}}<pre> 1 4 16 36 100 196 256 400 576 676 </pre> |
||
=={{header|PARI/GP}}== |
=={{header|PARI/GP}}== |