Anonymous user
Talk:Find largest left truncatable prime in a given base: Difference between revisions
Talk:Find largest left truncatable prime in a given base (view source)
Revision as of 09:09, 8 October 2012
, 11 years ago→Hint for base 10, 12, 14 etc: Some of my notes/thoughts
(→Hint for base 10, 12, 14 etc: Some of my notes/thoughts) |
|||
Line 8:
:At 5 I have found the number of candidates at each level to be the same as the number found at 100 (where I have been able to determine the 100 number).
--[[User:Nigel Galloway|Nigel Galloway]] 11:56, 21 September 2012 (UTC)
: It's fascinating that when I compare the number of primes at different stages using different levels of reliability testing, the difference with one Miller-Rabin round is only about 1% larger than the count with 5, and often rather less than that. This means that as the number of candidates narrows back down again as the prime size increases, the bad candidates seem to be being removed. Fascinating, that. Also, if you've not got a good MR implementation, you really ''need'' a decent <code>modpow()</code> function/operator; it makes a gigantic difference. (Now, to find a faster computer…) –[[User:Dkf|Donal Fellows]] 09:09, 8 October 2012 (UTC)
==Number of left truncatable primes in a given base==
| |||