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 08:57, 2 September 2013
, 10 years agoMake example clearer
(Make example clearer) |
|||
Line 1:
==Unclear text in page==
Could someone make the example where it says "in base 10 candidates are 2,3,5,7. Putting a digit in the range 1 to base-1 in front of each candidate must result in a prime. So 2 and 5, like the whale and the petunias in The Hitchhiker's Guide to the Galaxy, come into existance only to be extinguished" clearer? I thought it was about 12 and 15, but it is not.
==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 total compliance with your final candidate.--[[User:Nigel Galloway|Nigel Galloway]] 11:50, 15 September 2012 (UTC)
| |||