Primes: n*2^m+1: Difference between revisions

Primes: n*2^m+1 (view source)

117 bytes removed , 1 year ago

→‎{{header|ALGOL 68}}: Specifically state that the hard stretch goal is not satisfied.

3,048

edits

Revision as of 10:18, 27 September 2022 (view source) Tigerofdarkness (talk \| contribs) (→‎{{header\|ALGOL W}}: Only show 45 primes, in line with the new Task requirements.) ← Older edit		Revision as of 10:28, 27 September 2022 (view source) Tigerofdarkness (talk \| contribs) (→‎{{header\|ALGOL 68}}: Specifically state that the hard stretch goal is not satisfied.) Newer edit →
Line 17: =={{header\|ALGOL 68}}== {{works with\|ALGOL 68G\|~~2 or 3~~Any - Tested with release 3.0.3 under Windows}} {{libheader\|ALGOL 68-primes}} ~~Attempts~~Doesn't attempt the stretchier stretch goal -but ~~with~~does ~~2000~~show ~~digit~~the ~~precision~~primes ~~and restricting m~~up to ~~at most 600, all of the first~~ 400 ~~primes~~with ~~can~~uo beto ~~found, except for 383. Increasing the number of~~2000 digits and ~~max~~m nat tomost ~~8000~~600 ~~should~~which ~~find~~turns ~~prime~~out ~~383,~~to ~~however~~be Iall ~~couldn't~~of bethem ~~bothered~~except tofor ~~wait long enough..~~383.<br> The values of the primes are interesting - most will fit in 64 bits but there are a small number that have hundreds or thousands of digits. <br> <b>NB</b> the primes.incl.a68 source is available on a page in Rosetta Code - see the <b>library</b> above.