Talk:Penta-power prime seeds: Difference between revisions
no edit summary
(Commented) |
No edit summary |
||
| (5 intermediate revisions by 4 users not shown) | |||
Line 8:
::: It was certainly a worthwhile optimization for Wren - around a 40% improvement. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 19:25, 20 August 2022 (UTC)
::: Using get_prime() instead of n += 2 afforded me a 6-fold improvement. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 20:31, 20 August 2022 (UTC)
::Quote: <blockquote>the task requires testing 83 bit unsigned integers</blockquote>
::Good point. Added some verbiage to the task requirements for languages that can't easily do this. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 20:45, 20 August 2022 (UTC)
::: That would be the first seven values of the sequence, for typical 64 bit fixed width arithmetic implementations. I'm not sure that that will satisfy many implementors if it's not made an explicit goal. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 23:47, 20 August 2022 (UTC)
:::: Apologies for missing the main thrust of your post earlier, Rdm - you are right and for 32 bit languages, you could find the first 3 and for 16 bit languages (PL/M, Action!, many BASICS, VTL-2, ...), the first 2. --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 10:20, 21 August 2022 (UTC)
===Hexa-power prime seeds - or not===
I see there aren't any "Hexa-power prime seeds" other than 1, as there are no primes of the form n^5+n+1 where n > 1 according to [[oeis:A271209|A271209]]. --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 22:23, 20 August 2022 (UTC)
:Confess I googled it: n^5 + n + 1 is (n^2 + n + 1)(n^3 -n^2 + 1). --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 10:20, 21 August 2022 (UTC)
| |||