New largest prime discovered

mersenne.org/primes/press/M77232917.html

Neat

Other urls found in this thread:

mtholyoke.edu/courses/quenell/s2003/ma139/js/powermod.html,
en.wikipedia.org/wiki/Abc_conjecture#Some_consequences
mersenneforum.org/showpost.php?p=476213&postcount=325
twitter.com/AnonBabble

Did they remember to add or subtract 2 from it to check and see if it was a twin prime?

2^p+1 is definitely not a prime, as the only primes of this form are Fermat primes, which are actually written as 2^(2^n)+1

As for 2^p-3, I highly doubt it's prime, but who knows?
I checked a bit in mtholyoke.edu/courses/quenell/s2003/ma139/js/powermod.html, and it's not divisible by any prime less than 100
Even if it is prime (which has a probability of around 1/ln(2^277,232,917)~5.2x10^(-9)), it's a lot harder to verify than it is for Mersenne primes

>this excites autistic mathfags

>>this excites autistic mathfags
Who are you quoting?

and? new tools excite engies

you can do things with tools, what can you do with abc conjecture? wank off to it's complexity that is all.

>what can you do with abc conjecture?
en.wikipedia.org/wiki/Abc_conjecture#Some_consequences

The abc conjecture has a large number of consequences. These include both known results (some of which have been proven separately since the conjecture has been stated) and conjectures for which it gives a conditional proof. While an earlier proof of the conjecture would have been more significant in terms of consequences, the abc conjecture itself remains of interest for the other conjectures it would prove, together with its numerous links with deep questions in number theory.

Thue–Siegel–Roth theorem on diophantine approximation of algebraic numbers (Bombieri 1994)
The Mordell conjecture (already proven in general by Gerd Faltings) (Elkies 1991)
It is equivalent to Vojta's conjecture (in dimension 1). (Van Frankenhuijsen 2002)
The Erdős–Woods conjecture except for a finite number of counterexamples (Langevin 1993)
The existence of infinitely many non-Wieferich primes in every base b > 1 (Silverman 1988)
The weak form of Marshall Hall's conjecture on the separation between squares and cubes of integers (Nitaj 1996)
The Fermat–Catalan conjecture, a generalization of Fermat's last theorem concerning powers that are sums of powers (Pomerance 2008)
The L-function L(s, χd) formed with the Legendre symbol, has no Siegel zero (this consequence actually requires a uniform version of the abc conjecture in number fields, not only the abc conjecture as formulated above for rational integers) (Granville & Stark 2000)
P(x) has only finitely many perfect powers for integral x for P a polynomial with at least three simple zeros.[8]
A generalization of Tijdeman's theorem concerning the number of solutions of ym = xn + k (Tijdeman's theorem answers the case k = 1), and Pillai's conjecture (1931) concerning the number of solutions of Aym = Bxn + k.

I wish Mochizuki had spent his time on something useful such as a working warp drive.

What this an attempt to refute what said or to prove it?

Bumb :^Ddd

Who cares? There are infinitely many such primes.

Who knew arithmetic could be so fucked

2^p-3 has been verified non-prime (for our p):

mersenneforum.org/showpost.php?p=476213&postcount=325

Infinitely many Mersenne? You'd be quite famous if you'll manage to prove that

>number theory
Who gives a shit?

What is Cryptography?

>wow how unexpected

>The primality proof took six days of non-stop computing on a PC with an Intel i5-6600 CPU.
woahhh such computing power

cant tell if newfag or just engiqueer

they probably meant 'it took ONLY six days'.

it's nothing spectacular imo

sure there are millions of primes to check but some nerd that has electricity baked into his rent could just run it for a chance at the cash prize

Why won't you do it yourself then?

Not trying to be condescending, if it's easy for you I highly recommend downloading GIMPS
It's entertaining and you may earn money and fame