Find squares n where n+1 is prime: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add C) |
Not a robot (talk | contribs) (Add MAD) |
||
Line 249: | Line 249: | ||
</lang>{{out}}<pre> 1 4 16 36 100 196 256 400 576 676 </pre> |
</lang>{{out}}<pre> 1 4 16 36 100 196 256 400 576 676 </pre> |
||
=={{header|MAD}}== |
|||
<lang MAD> NORMAL MODE IS INTEGER |
|||
BOOLEAN PRIME |
|||
DIMENSION PRIME(1000) |
|||
INTERNAL FUNCTION(S) |
|||
ENTRY TO ISQRT. |
|||
X0 = S/2 |
|||
WHENEVER X0.E.0, FUNCTION RETURN S |
|||
FNDRT X1 = (X0 + S/X0)/2 |
|||
WHENEVER X1.GE.X0, FUNCTION RETURN X0 |
|||
X0 = X1 |
|||
TRANSFER TO FNDRT |
|||
END OF FUNCTION |
|||
THROUGH INIT, FOR P=2, 1, P.G.1000 |
|||
INIT PRIME(P) = 1B |
|||
THROUGH SIEVE, FOR P=2, 1, P*P.G.1000 |
|||
THROUGH SIEVE, FOR C=P*P, P, C.G.1000 |
|||
SIEVE PRIME(C) = 0B |
|||
THROUGH TEST, FOR P=2, 1, P.G.1000 |
|||
WHENEVER PRIME(P) |
|||
SQ = P-1 |
|||
SQR = ISQRT.(SQ) |
|||
WHENEVER SQR*SQR.E.SQ |
|||
PRINT FORMAT FMT, SQ |
|||
END OF CONDITIONAL |
|||
END OF CONDITIONAL |
|||
TEST CONTINUE |
|||
VECTOR VALUES FMT = $I4*$ |
|||
END OF PROGRAM</lang> |
|||
{{out}} |
|||
<pre> 1 |
|||
4 |
|||
16 |
|||
36 |
|||
100 |
|||
196 |
|||
256 |
|||
400 |
|||
576 |
|||
676</pre> |
|||
=={{header|Mathematica}} / {{header|Wolfram Language}}== |
=={{header|Mathematica}} / {{header|Wolfram Language}}== |
||
<lang Mathematica>Cases[Table[n^2, {n, 101}], _?(PrimeQ[# + 1] &)]</lang> |
<lang Mathematica>Cases[Table[n^2, {n, 101}], _?(PrimeQ[# + 1] &)]</lang> |
||
Line 254: | Line 299: | ||
{1,4,16,36,100,196,256,400,576,676,1296,1600,2916,3136,4356,5476,7056,8100,8836} |
{1,4,16,36,100,196,256,400,576,676,1296,1600,2916,3136,4356,5476,7056,8100,8836} |
||
</pre> |
</pre> |
||
=={{header|Modula-2}}== |
=={{header|Modula-2}}== |