I recently came across a type of numbers called as **superprimes**. A superprime is an integer (such as 7331) such that all its left-to-right initial segments are prime (for 7331 the segments are 7, 73, 733, and 7331, all prime).

The fun fact is, there is a **largest possible superprime**. Can you find it ?

No vote yet

23 votes

×

Problem Loading...

Note Loading...

Set Loading...

$</code> ... <code>$</code>...<code>."> Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in $</span> ... <span>$ or $</span> ... <span>$ to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestI get 73939133.

Log in to reply

Yup.The largest superprime is 73939133. Can you show how you arrived at this answer?

Log in to reply

how did u get it?

Log in to reply

You need a computer program. Just generate the list $L_n$ of superprimes with $n$ digits (base case $n =1$, $L_1 = \{ 3, 7 \}$) and then use it to generate the list of superprimes with $n+1$ digits, by having your program check whether $10p + 1, 10p + 3, 10p + 7, 10p + 9$ are prime, for all $p \in L_n$. Repeat until $L_n$ is empty. In particular I got that $L_8$ had two elements and $L_9$ had none. The prime 73939133 was the larger of the two.

Log in to reply

$L_1=\{2,3,5,7\}$, so you are missing a few. I think that $L_8$ has about five elements.

Well,Log in to reply

$|L_8| = 5$.

Yes indeed, thanks for pointing that out! I agree thatLog in to reply

Log in to reply

Your name is Bruce Wayne?

Log in to reply

I don't think so!

Log in to reply

Nops :P. I just use this name every now and then. I have seen screen names like 'Harvey Dent' and 'Batman' too.

Log in to reply

There is one more interesting thing called the

'EMIRP'.Its a prime from both the ways(i.e from left to right and right to left).

Example; 13,17,31.37...

Log in to reply

Is their any solid reason or proof for the 'statement' you stated. If their then please provide.

Log in to reply

I was wrong,the problem is a conjecture

I thought it was obvious to have infinitely many emirps.

Log in to reply

If I had a proof of the infinitude of emirps I'd just say "There are infinitely many." If instead I said "There

mustbe infinitely many" it would be a statement about how the world should be if there's any justice, rather than a statement of fact :).Heuristically, one should expect infinitely many emirps: there are about $O(10^d/d)$ primes with $d$ digits, so about $O(10^d/d^2)$ of them would be primes in reverse, as long as there are no unexpectedly negative correlations between primes and reverse primes.

Log in to reply

Log in to reply

me too 73939133

Log in to reply

Yup.The largest superprime is 73939133. Can you show how you arrived at this answer?

Log in to reply

Is there any way to prove that the largest superprime is 73939133?

Log in to reply

How would anyone even hope to find the largest superprime without either using a computer program or just searching it up? I find that you asking people how they came up with the answer is rather pointless. If anyone writes out a rigorous proof that this is the largest, or even just a solution to arrive at this prime, THEN I will eat my own words.

Log in to reply

People want to know if there is an elegant way to find the largest superprime. It may be possible that the solution requires the use of computers. This discussion is to clear that out.

Log in to reply

I don't believe that there aren't an infinite amount of super primes...

Log in to reply

Do you believe there is an infinite string of digits whose initial segments are always prime? (Hint: the two beliefs are equivalent.)

Heuristically, in any base $b$ one should expect only finitely many superprimes: for any superprime of length $n$ there are $b$ possible extensions to length $n+1$, and only about 1 in $n \log b$ candidates of that size will be prime. Thus (heuristically) the superprimes will start to dwindle after passing $n > b/\log b$ digits, until there are no more.

Log in to reply

Weeks ago I did this:

http://archives.somee.comto search for prime numbers, I think I could easily add a method to search forsuperprimes. But I'd love to see someone solve this by pure mathematics.Log in to reply

73939133

Log in to reply