Intereting Posts

Topological group: Multiplying two loops is homotopic to linking these paths?
Evaluate: $\int_0^{\pi} \ln \left( \sin \theta \right) d\theta$
An oddity in some linear equations
Counting Coprime Numbers in a range:
Circle areas on squared grid
List of interesting math podcasts?
Help with proof of expected value of gamma distribution
$L^1(μ)$ is finite dimensional if it is reflexive
Show that there is a positive integer $n$ such that $G \cong \ker(\phi^{n}) \times \phi^{n}(G)$
For which real numbers $x$ is $\arcsin(2x^2-1)-2\arcsin x=-\dfrac{\pi}{2}$
Ways to put $n$ balls into $m$ boxes
How to calculate the Fourier transform of a Gaussian function.
How do I solve $\displaystyle\int \frac{\mathrm{d}x}{e^x + 1} $?
Is arrow notation for vectors “not mathematically mature”?
Uncountable minus countable set is uncountable

So a couple of days ago the $17$ million digit number $2^{57885161}-1$ was beaten by the $22$ million digit number $2^{74207281}-1$ at being the largest known prime number.

Are there any specific (purely mathematical) implications of the fact that this particular number is prime? In particular, does this resolve something other than the question if $2^{74207281}-1$ is prime, in the style of some newly discovered theorem resolving previous conjectures? Is it perhaps a counterexample to something so far believed to be true?

Edit: I’m aware of the many non-(strictly mathematical) practical implications and reasons to continue the search for large primes (cryptography etc), but I’m not aware of any strictly mathematical uses of particular numbers being prime, which is why (and what) I’m asking.

- Minimal time gossip problem
- Solving a recurrence relation, $a_n = \sqrt{n(n+1)}a_{n-1} + n!(n+1)^{3/2}$
- Why is the Relation R4 Reflexive?
- Gay Speed Dating Problem
- A robot moves on 2-Dimensional grid. It starts out at (0,0) and is allowed to move in any of these four ways:
- Expected days to finish a box of cookies

- Prove that neither $A$ nor $B$ is divisible by $5$
- Pythagorean triples and Pell numbers.
- $a+b\sqrt{-3}$ and $a-b\sqrt{-3}$ are coprime in $\mathbb{Z}+ \omega \mathbb{Z}$
- Largest Triangular Number less than a Given Natural Number
- (Counting problem) very interesting Modular N algebraic eqs - for combinatorics-permutation experts
- Show that the square of any prime number is the Factof of some integer
- Triangular Factorials
- How many ways are there for 10 women and six men to stand in a line
- Find an infinite set of positive integers such that the sum of any two distinct elements has an even number of distinct prime factors
- Logic and number theory books

It has no practical applications in mathematics or any other field as far as I know.

It is expected that there are an infinite number of Mersenne primes, so discovering a new one is completely in line with that. On the other hand, it would be much more interesting and perhaps somehow consequential if we *failed* to find a new one where one ought to be according to the conjectured distribution. Or if we found two whose exponents were very close together, that would also be quite a surprise begging for a mathematical explanation; there is no way to rule this out currently, it may be the case that $2^p-1$ is prime for *all* sufficiently large prime $p$. But this one is completely ordinary-looking and its discovery is just one more piece of evidence for what is already widely-believed.

RSA cryptography relies on the difficulty of factoring composite numbers whose prime factors are unknown, so big Mersenne primes have no relationship to this. There are other cryptosystems based on the discrete logarithm problem such as Diffie-Hellman and ElGamal that use known prime numbers as parameters, but much smaller primes are secure enough, and Mersenne primes are considered unsuitable because they are not safe.

Mersenne primes are used in PRNGs like MT19937 because it is faster to perform multiplication in binary modulo a Mersenne prime versus other types of primes. But it will take some decades of continuation of Moore’s law before giant Mersenne primes find a role here and that seems quite unlikely.

So why does anybody care then? Because it’s an awesomely difficult accomplishment that inspires the public and gets people interested in learning more about mathematics. And what aspiring and ambitious mathematician wouldn’t be proud to see their name preserved in history alongside Leonhard Euler? It’s the type of thing that we celebrate for its own sake.

I made a list of reasons why mathematicians care about perfect numbers and Mersenne primes which may be relevant. But the search is mainly done for aesthetic reasons, not because of those applications. However, there are also spillover benefits. The search for Mersenne primes led to the discovery of a flaw in certain Intel processors, for example. More importantly, it has led the development of fast FFT software for large numbers, which have myriad applications in industry. (The search uses relatively large numbers, so they have to develop new software to run efficiently there, but as computers become generally more efficient those sizes become useful for many practical projects.)

But I can’t think of any reason that knowing that this particular number is prime would advance mathematics, not on its own. If enough Mersenne primes are found, though, it will provide evidence for or against standard conjectures about how they are distributed. If it’s what we expect that changes very little, but if they aren’t then finding out why and how are suddenly very important questions, because that might undermine other assumptions built on apparently-faulty premises.

Well, there have been cases in the past where a conjecture was eventually refuted only for an extremely large value. So finding such number (and at a certain distance from the previous number), may contribute to our knowledge of some yet unproven conjecture.

Here is one such example of a conjecture that was eventually refuted only for an extremely large value (though in this case it was not refuted as a direct result of discovering that value):

Consider the following functions:

- The prime-counting function $\pi(n)$
- The logarithm-integral function $Li(n)=\int\limits_{2}^{n}\frac{1}{\ln{x}}dx$

The *prime number theorem*, stating that $\pi(n) \approx Li(n)$, was proved in $1896$.

For small values of $n$, it had been checked and always found that $\pi(n)<Li(n)$.

As a result, many prominent mathematicians, including no less than **both Gauss and Riemann**, conjectured that the inequality was strict.

To everyone’s surprise, this conjecture was refuted in $1914$.

It’s worth noting that it was refuted **not** by a counterexample, but by proving that a counterexample existed (in fact, an exact counterexample remains unknown to this day).

Read this for more details…

- Ultrafilters – when did it start?
- Is infinity larger than 1?
- Book/Books leading up to the the axiom of choice?
- How to solve an exponential equation with two different bases: $3^x – 2^x = 5$
- Gradient steepest direction and normal to surface?
- Solve equation $4^x-3\cdot6^x+2\cdot9^x=0$
- From injective map to continuous map
- Prove that if $\mathcal P(A) \cup \mathcal P(B)= \mathcal P(A\cup B)$ then either $A \subseteq B$ or $B \subseteq A$.
- Decomposition of a degenerate conic
- An identity of an Elliptical Integral
- If $n = m^3 – m$ for some integer $m$, then $n$ is a multiple of $6$
- Showing the countable direct product of $\mathbb{Z}$ is not projective
- Average number of guesses to guess number between 1 and 1000?
- Mathematics in French
- On matrix norm equivalence