Anonymous user
User talk:Petelomax: Difference between revisions
→Smallest power of 6 whose decimal expansion contains n: Changed to your verion of checking
(→Smallest power of 6 whose decimal expansion contains n: Changed to your verion of checking) |
|||
Line 226:
</pre>
: Note sure what to make of "mean power". All I did to test mine was save the last thing found, then use gmp to independently generate that power of 6 and prove that final digit string did indeed occur somewhere in it. I transpiled it to JavaScript (am actively working on that technology and have not yet released it) and that took 13mins 10s for the 10,000,000 run, 35s for a 1,000,000 run. AH: have you just fixed this now? --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 16:35, 9 April 2021 (UTC)
::Hello Pete,<BR>now I understand, how you solved the task.Your version of PHIX takes 1m14s on my computer.<BR>I translate the principle into pascal with a small optimization to jump over the first already found numbers.Especially for many digits it brings a speedup.11s downto 9s for 10,000,000 aka 7 decimal digits
| |||