Anonymous user
Find largest left truncatable prime in a given base: Difference between revisions
Find largest left truncatable prime in a given base (view source)
Revision as of 17:48, 27 May 2016
, 8 years agoadded whitespace before the TOC (table of contents).
(Added Sidef) |
m (added whitespace before the TOC (table of contents).) |
||
Line 1:
{{task}}
A [[Truncatable primes|truncatable prime]] is one where all non-empty substrings that finish at the end of the number (right-substrings) are also primes ''when understood as numbers in a particular base''. The largest such prime in a given (integer) base is therefore computable, provided the base is larger than 2.
Line 12 ⟶ 13:
Related Tasks:
* [[Miller-Rabin primality test]]
<br><br>
=={{header|BBC BASIC}}==
| |||