Superprimes

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 ?

#NumberTheory #MathProblem #Math

Note by Bruce Wayne
7 years, 6 months ago

No vote yet
23 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

I get 73939133.

Patrick Corn - 7 years, 6 months ago

Log in to reply

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

Bruce Wayne - 7 years, 6 months ago

how did u get it?

Akshay Ginodia - 7 years, 6 months ago

Log in to reply

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

Patrick Corn - 7 years, 6 months ago

Log in to reply

@Patrick Corn Well, L1={2,3,5,7}L_1=\{2,3,5,7\}, so you are missing a few. I think that L8L_8 has about five elements.

Mark Hennings - 7 years, 6 months ago

Log in to reply

@Mark Hennings Yes indeed, thanks for pointing that out! I agree that L8=5 |L_8| = 5 .

Patrick Corn - 7 years, 6 months ago

@Patrick Corn elegant approach

Gaurav Jain - 6 years, 2 months ago

Your name is Bruce Wayne?

Tanishq Aggarwal - 7 years, 6 months ago

Log in to reply

I don't think so!

Ranjana Kasangeri - 7 years, 6 months ago

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

Harvey Dent - 7 years, 6 months ago

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...

Ranjana Kasangeri - 7 years, 6 months ago

Log in to reply

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

SHUBHAM KUMAR - 7 years, 6 months ago

Log in to reply

I was wrong,the problem is a conjecture

I thought it was obvious to have infinitely many emirps.

Ranjana Kasangeri - 7 years, 6 months ago

If I had a proof of the infinitude of emirps I'd just say "There are infinitely many." If instead I said "There must be 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(10d/d)O(10^d/d) primes with dd digits, so about O(10d/d2)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.

Erick Wong - 7 years, 6 months ago

Log in to reply

@Erick Wong The number of palindromic primes and the number of emirps (e.g. whether they're infinite or not) are both open problems.

Michael Tong - 7 years, 6 months ago

me too 73939133

devansh shringi - 7 years, 6 months ago

Log in to reply

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

Bruce Wayne - 7 years, 6 months ago

Log in to reply

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

Mateo Torres - 7 years, 6 months ago

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.

Daniel Liu - 7 years, 6 months ago

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.

Bruce Wayne - 7 years, 6 months ago

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

A Former Brilliant Member - 7 years, 6 months ago

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 bb one should expect only finitely many superprimes: for any superprime of length nn there are bb possible extensions to length n+1n+1, and only about 1 in nlogbn \log b candidates of that size will be prime. Thus (heuristically) the superprimes will start to dwindle after passing n>b/logbn > b/\log b digits, until there are no more.

Erick Wong - 7 years, 6 months ago

Weeks ago I did this: http://archives.somee.com to search for prime numbers, I think I could easily add a method to search for superprimes. But I'd love to see someone solve this by pure mathematics.

Mateo Torres - 7 years, 6 months ago

73939133

bobby jim - 7 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...