"The good news is that the world will still be safe."
"The prime numbers [ ... ] are the solutions of infinitely many special Diophantine equations' in well-studied partition functions," they explain in their new paper.
"In other words, integer partitions detect the primes in infinitely many natural ways."
So I looked up how to find if it's a prime number, surely there's a Wikipedia article for that.
Primality Test
en.wikipedia.org
The fastest current test for if a number is prime is order (log n)^6, where n is the very large prime number.
Reading the paper "Integer partitions detect the primes"
https://www.pnas.org/doi/10.1073/pnas.2409417121
They present a cubic equation, aka order n^3.
So whether a cubic equation in n, which is a very large prime, is faster than a sixth power equation in log n, which would be a much smaller number, I really couldn't say, but I wouldn't be surprised if this finds its way into computer science.
Drudge Retort Headlines
Jack Smith Under Investigation by Office of Special Counsel (49 comments)
Killing Democracy (40 comments)
85% of Parents Fear Trump Tax Back-to-School Costs (18 comments)
Trump Says Job Numbers Were Rigged (18 comments)
Humanity May Reach Singularity Within Just 5 Years, (17 comments)
It's the Worst Time to Be an American Farmer in Decades (15 comments)
What's Horrifying About Kids who Get Phones Early in Life (15 comments)
India Says No to F-35 Fighter Jets from US (15 comments)
Trump Gushes over Karoline Leavitt's Lips (14 comments)
Report: DOGE Wasted $21.7 Billion of American Taxpayer Money (14 comments)