Talk:Pierpont primes: Difference between revisions
→Scale back 2nd part?: Want some cheese with that whine?
(→Scale back 2nd part?: added some comments.) |
Thundergnat (talk | contribs) (→Scale back 2nd part?: Want some cheese with that whine?) |
||
Line 13:
:::::: I assume most visitors to this task page have noticed that there are no "BASIC" (interpretive) programming languages entered This task (I think) shouldn't be about writing a very robust '''isPrime''' function (if a language doesn't have one), but about (I assume) generating Pierpont primes. Finding the 250<sup>th</sup> Pierpont prime (for each type), is just a bridge too far. So far, at the time of this posting, there are nine computer programming languages that accomplish the task's 4<sup>th</sup> requirement, and I doubt there will be that many more (perhaps there will be others entered when this draft task gets promoted --- I've noticed that there's a surge of additional entries/solutions when a task gets promoted). If the goal is to have as many computer programming languages entered for this task (for comparisons and learning), this isn't the way to encourage that. The Rosetta Code task [https://rosettacode.org/wiki/Sequence_of_primorial_primes <u>sequence of primorial primes</u>] has a similar problem, but it does have more solutions/entries, however. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 00:20, 25 September 2019 (UTC)
::::::: I rather suspect that the larger restriction for many Basics is (lack of, or not built in) large integer support rather than primality testing. (And even more than that, the lack of anyone with the urge to write an entry...) As I demonstrated above, Miller-Rabin is more than adequate to do the testing, and helpfully, there are many implementations in many different languages [[Miller–Rabin_primality_test|already available]]. If that doesn't float your boat, Pierpont numbers specifically lend themselves to primality testing by Proths theorem. The task is only asking for the 250th prime. There are other tasks asking for the 100000th prime; Cuban primes for example. If you don't want to do the task, or think it is too difficult, don't do it. It has already been demonstrated that the stated goals are pretty easily achievable. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 12:01, 25 September 2019 (UTC)
== Final Digits ==
| |||