Talk:Pierpont primes: Difference between revisions

Content added Content deleted

Inline

Revision as of 01:20, 19 August 2019 (view source) Thundergnat (talk \| contribs) (→‎Scale back 2nd part?: comment) ← Older edit		Revision as of 05:54, 19 August 2019 (view source) rosettacode>Gerard Schildberger (→‎Scale back 2nd part?: added a comment.) Newer edit →
Line 5:		Line 5:

	:::It is very likely going to be much more efficient to generate Pierpont numbers and check if they are prime than to generate primes and check if they are Pierponts. --[[User:Thundergnat\|Thundergnat]] ([[User talk:Thundergnat\|talk]]) 01:20, 19 August 2019 (UTC)		:::It is very likely going to be much more efficient to generate Pierpont numbers and check if they are prime than to generate primes and check if they are Pierponts. --[[User:Thundergnat\|Thundergnat]] ([[User talk:Thundergnat\|talk]]) 01:20, 19 August 2019 (UTC)

			:::: Essentially, this isn't going to help comparing computer programming code to find/display ginormous (Pierpont) primes,   unless one has a robust   '''isPrime'''   function (mostly likely a BIF).   There is nothing to learn about <u>using</u> an   '''isPrime'''   BIF.   Otherwise, it's just an exercise in <strike>wasting</strike> consuming electric power.     -- [[User:Gerard Schildberger\|Gerard Schildberger]] ([[User talk:Gerard Schildberger\|talk]]) 05:52, 19 August 2019 (UTC)