Revision as of 10:58, 14 July 2016 view source Dinosaur (talk \| contribs) 1,220 edits →‎{{header\|EchoLisp}}: Add Fortran. ← Older edit		Revision as of 11:04, 14 July 2016 view source Dinosaur (talk \| contribs) 1,220 edits m →‎{{header\|Fortran}}: Agh. Remove detritus. Newer edit →
Line 406: 61 421 12841 329769721 61 181 5521 60957361</pre> Which turns out to be when the two terms have remainders of one. So, using the double MOD approach - which gives the same result for either style of MOD... <lang Fortran> LOGICAL FUNCTION ISPRIME(N) !Ad-hoc, since N is not going to be big... INTEGER N !Despite this intimidating allowance of 32 bits... INTEGER F !A possible factor. Line 435: IF (ISPRIME(P3)) THEN !Is it prime? IF (MOD(P2P3,P1 - 1).EQ.1) THEN !Yes! Final test. ~~PPP~~WRITE =(MSG,2) P1,P2,P3, INT8(P1)P2P3 !~~This converts to INTEGER8.~~Result! ~~PPP = PPPP2P3 !So the product is computed that way, without named conversion functions.~~ ~~WRITE (MSG,2) P1,P2,P3, INT8(P1)P2P3 !Result!~~ 2 FORMAT (3I6,I12) END IF

Carmichael 3 strong pseudoprimes: Difference between revisions