Find prime numbers of the form n*n*n+2: Difference between revisions
Find prime numbers of the form n*n*n+2 (view source)
Revision as of 01:35, 21 December 2021
, 2 years agoAdd MAD
Not a robot (talk | contribs) (Add J) |
Not a robot (talk | contribs) (Add MAD) |
||
Line 849:
<lang julia>using Primes; println(filter(isprime, map(x -> x^3 + 2, 1:199)))</lang>{{out}}<pre>
[3, 29, 127, 24391, 91127, 250049, 274627, 328511, 357913, 571789, 1157627, 1442899, 1860869, 2146691, 2924209, 3581579, 5000213, 5177719, 6751271]</pre>
=={{header|MAD}}==
<lang mad> NORMAL MODE IS INTEGER
INTERNAL FUNCTION(P)
ENTRY TO PRIME.
WHENEVER P.L.2, FUNCTION RETURN 0B
WHENEVER P.E.P/2*2, FUNCTION RETURN P.E.2
WHENEVER P.E.P/3*3, FUNCTION RETURN P.E.3
D = 5
CHKDIV WHENEVER D*D.LE.P
WHENEVER P.E.P/D*D, FUNCTION RETURN 0B
D = D+2
WHENEVER P.E.P/D*D, FUNCTION RETURN 0B
D = D+4
TRANSFER TO CHKDIV
END OF CONDITIONAL
FUNCTION RETURN 1B
END OF FUNCTION
VECTOR VALUES FMT = $4HN = ,I3,S4,12HN*N*N + 2 = ,I7*$
THROUGH LOOP, FOR N=1, 1, N.GE.200
M = N*N*N + 2
WHENEVER PRIME.(M)
PRINT FORMAT FMT,N,M
END OF CONDITIONAL
LOOP CONTINUE
END OF PROGRAM</lang>
{{out}}
<pre>N = 1 N*N*N + 2 = 3
N = 3 N*N*N + 2 = 29
N = 5 N*N*N + 2 = 127
N = 29 N*N*N + 2 = 24391
N = 45 N*N*N + 2 = 91127
N = 63 N*N*N + 2 = 250049
N = 65 N*N*N + 2 = 274627
N = 69 N*N*N + 2 = 328511
N = 71 N*N*N + 2 = 357913
N = 83 N*N*N + 2 = 571789
N = 105 N*N*N + 2 = 1157627
N = 113 N*N*N + 2 = 1442899
N = 123 N*N*N + 2 = 1860869
N = 129 N*N*N + 2 = 2146691
N = 143 N*N*N + 2 = 2924209
N = 153 N*N*N + 2 = 3581579
N = 171 N*N*N + 2 = 5000213
N = 173 N*N*N + 2 = 5177719
N = 189 N*N*N + 2 = 6751271</pre>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
| |||