Waste less time on Facebook — follow Brilliant.
×

Utomo Theorem ~ The Next Millenium Prize Problem

Utomo Theorem For every prime numbers p which p + 2 is also prime, then \(2^{p+2}\) - 1 always prime.


Can you proves this conjecture?

Note by Budi Utomo
5 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

What you mean is the larger one of every twin prime would produce a Mersenne Prime ? Oh I need to check this out Aditya Narayan Sharma · 4 months, 1 week ago

Log in to reply

It's actually easier to list the primes \(p\) which satisfy your statement than to find the list that fails it. Just compare any list of twin primes with a list of Mersenne primes, and you'll see that the \(p\) which satisfy your statement are \[p = 3, 5, 11, 17, 29, 59, 1277, 4421, 110501, 132047, \ldots\] and at this point, I got a little tired of looking.

Point being, in the first 8000 or so twin primes, only these 10 satisfy your statement, so there's no way to patch it by removing just a few errant counterexamples. Brian Moehring · 5 months ago

Log in to reply

you sure that 2^43 - 1 isn't prime number :( Budi Utomo · 5 months ago

Log in to reply

but, in f(p) = 2^p - 1 hasn't always gives a prime marsenne. Budi Utomo · 5 months ago

Log in to reply

maybe, except just for p = 41. Budi Utomo · 5 months ago

Log in to reply

From this theorem, we knew that a large primes is infinite. Budi Utomo · 5 months ago

Log in to reply

@Budi Utomo For a counter example, take p=41, 2^43-1 is not prime. See this Brilliant Member · 5 months ago

Log in to reply

@Budi Utomo Actually, the numbers of the form 2^n-1 that are prime are known as Mersenne primes. Read this Brilliant Member · 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...