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 11:56, 21 September 2012
, 11 years ago→Hint for base 10, 12, 14 etc
Line 1:
==Hint for base 10, 12, 14 etc==
Where the maximum left truncatable prime in a base is say 24 digits or more, to solve this task fully, try using a quick test for probable primality. Then only test for
Note, that setting the confidence too low will increase the number of composites which will need to be tested and so may not lead to optimal performance.
Using java.math.BigInteger.new(candidate).isProbablePrime(confidence):
:At 1 I found that the number of candidates at some levels increased over that achieved at 100.
: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)
==Number of left truncatable primes in a given base==
| |||