Talk:Euclid-Mullin sequence: Difference between revisions
→Question re Pollard's Rho: Further comment.
(Thanks to Thundergnat.) |
(→Question re Pollard's Rho: Further comment.) |
||
Line 12:
:: Yeah, it's a pity but I'm sure you're right that we can't rely on a simple implememtation finding factors in magnitude order, so thanks for confirming that. Much as I love PR, you're stuffed on time if there are no smallish factors as seems to be the case with the above 61 digit number. I'll try and get my 9 minute version (which avoids a second round of PR) into shape for posting. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:14, 21 July 2023 (UTC)
::: Managed to reduce the runtime to 6 minutes 17 seconds - basically I'm just using trial division to see if there's a smaller factor rather than risk getting stuck on a second round of PR. Not exactly efficient but good enough for now. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 09:23, 23 July 2023 (UTC)
| |||