How Large Are Mersenne Primes in Decimal Digits?

  • Thread starter Thread starter anil
  • Start date Start date
  • Tags Tags
    Primes
anil
Messages
30
Reaction score
0
A prime number is a positive ineger greater than 2 whose only integer divisors are itself and 1. A Mersenne prime in of the form 2^(n) - 1 where p is a prime. For example 2^(5) - 1 = 31 is a Mersenne prime. One of the larger Mersenne prime is 2^(216091) - 1. Estimate the number of decimal digits in this number.

Please post your explanation and your answer. No this problem needs no calculus. Got guts[?]
 
Mathematics news on Phys.org
Okay it's not my job to do your homework, so I will only give you a few pointers:

The -1 is unimortant to your estimate, so ignore that for the minute:

You can then construct this equation:

2^(216091) = 10^x

From here it should be very easy to solve.
 
Kiddo: this is not my HW

This is not my homework. LoL this is a "challenge problem" they give in my college to exercise brain. I got the answer I just want to see my asnwer is right. 72030
 
No your answer is wrong, look at the equation I gave again, you may of made a simple error.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top