Talk:Ramanujan primes: Difference between revisions
Content added Content deleted
| Line 1: | Line 1: | ||
=== Unexpectedly fast === |
=== Unexpectedly fast === |
||
Surprisingly the Phix entry is much faster than the Julia entry, usually it is the other way round, and that was true even before I applied the obvious optimisation of checking whether n>length(picache), which sped it up 50-fold. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 12:06, 3 September 2021 (UTC) |
Surprisingly the Phix entry is much faster than the Julia entry, usually it is the other way round, and that was true even before I applied the obvious optimisation of checking whether n>length(picache), which sped it up 50-fold. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 12:06, 3 September 2021 (UTC) |
||
: Not that I have any idea what Wherrera just did there, but yep, 200 times faster here. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 01:37, 4 September 2021 (UTC) |
: Not that I have any idea what Wherrera just did there, but yep, 200 times faster here, normality restored. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 01:37, 4 September 2021 (UTC) |
||
Latest revision as of 01:40, 4 September 2021
Unexpectedly fast
Surprisingly the Phix entry is much faster than the Julia entry, usually it is the other way round, and that was true even before I applied the obvious optimisation of checking whether n>length(picache), which sped it up 50-fold. --Pete Lomax (talk) 12:06, 3 September 2021 (UTC)
- Not that I have any idea what Wherrera just did there, but yep, 200 times faster here, normality restored. --Pete Lomax (talk) 01:37, 4 September 2021 (UTC)