"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
Retort Weekend Tunes (34 comments)
Florida Locals Defy DeSantis, Restore Pulse Rainbow Crosswalk (31 comments)
Homeowner Shoots 2 Men in Masks Claiming to Be Cops (26 comments)
Greene Issues Scathing Rebuke of Conditions in Gaza (25 comments)
FBI Plans to Lower Hiring Standards (23 comments)
WTTC: U.S. Only Major Nation to See Decline in Tourism (12 comments)
Bluesky Blocks Mississippi over Age Verification Law (11 comments)
Blue States Prepare for 'Soft Succession' (10 comments)
Only 8 People Show Up to Nancy Mace Speech (9 comments)
Vance Mocked for WWII History Blunder (8 comments)