"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
Trump Says Epstein Files Were Written by Obama, Clinton (125 comments)
U.S. Inflation Accelerated in June (99 comments)
Coffee Just Became More Expensive Because of Trump Tariffs (28 comments)
American Views on Immigration Take Massive Positive Swing (25 comments)
MAGA Is Tearing Itself Apart over Jeffrey Epstein (25 comments)
U.S. Utilities Seeking Big Hikes in Electricity Rates (23 comments)
Poor Countries Hiring Lobbyists to Sway Donald Trump (22 comments)
SCOTUS Gives Him Go Ahead to Fire Hundreds in Dept of Education (19 comments)
Ken Paxton's Wife Files for Divorce on 'biblical grounds' (16 comments)
ICE Raids Leaving Cats and Dogs Homeless (16 comments)