Anonymous user
Talk:Pierpont primes: Difference between revisions
→Scale back 2nd part?: added some comments.
Thundergnat (talk | contribs) (→Scale back 2nd part?: clarify) |
(→Scale back 2nd part?: added some comments.) |
||
Line 11:
:::::Even in an on-line limited and throttled VM it finishes in (slightly) less than 30 seconds. <span style="background-color:yellow;">[https://tio.run/##lVRNb9pAED3Dr5gip7HBrIxJ2gSLKOohUg@VemhPhESbeF1cf6xlLwGU0D/WW/8YnV1sWBuUtIuQ1zPz3ny8XWcsjz9sNskKPnEeQzKPRQjF/AHC4j7Lw4SZn1MBRmqDekYwhoHjWKCtZ8iZmOcp3NC4YB6s26@wua8Q1dm@5fO3yLalwWLGcoZA4x6uwAWa@nJ7gtt1M9tzu4V8yuajDcF9GHh7Y4FGx2u3W4tZGDMZdCJ5ENbCvR8@jcH15EvR6@FzjZEBz8F0gZA7pLNIFj5GphFZ0L8CgyokkhtLJGbLLOG@aVAbiW0ZLTO1UrYUEAYqBssE5Ntuq@owRiYZbHMUirNVY1za4JaE6NLl0IiVL6aFlmzXP3ZyFPdOD5Ld6uK00SD1yEKWZxzHZxpilSG0gEeereTM5cSlqj@oQJHKF7kCGsbQ@Z5GKV@kIGEjUGgCX@ZY4gMDnuI/wLZNnwUU1bfkaNyOKk0lktUNXlCQilXQiKFcu4Bt25W3tEF/UIvQ8IWgAlXP@HB7Dhp26vt9WdUYhk3fdShYTgXP5QmauPaZfYFyEehOSeWxYTK0L233Y9OBCldkeFSuZ4zKs7ln/PObZPM4lqm10JjzTBtoiTYiJgevSEhGw7wgSZia0CVPNJ4zsAgGeAcojKlQE0kxrYdojlplW9Ox6nZqKOpeOW0cu6kbLPK@uswNrBRIBl6N92OvN6tWryfF8g4d@xqxumI2AnPyYppKF4skNBtBF39D6HaV3FapiaWJcsipptDTpMZ70RhI06vN5oBv11i3dqDkWrfru7W6a3QFnRuUVMC5A1@rW6fGV8irgncMAuWPwtQf3aYd@LW7nZO7c2dKco6lmQPHwkMVJMI8PbnwTy3yk4fpCDqI8Mo8t@lbmQr2yPFTeySV6Vr/nc09d8SskepIT1BryT27nP4bhV4sNGtVNJvNXw Try it online!]</span> I'm somewhat inclined to let it stand. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 13:22, 19 August 2019 (UTC)
:::::: 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)
== Final Digits ==
| |||