"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
SCOTUS: Okay to Deport People to Random Countries with no Notice (118 comments)
Iran Attacks US Bases in Qatar, Iraq (104 comments)
Trump: 'Ceasefire' Between Israel-Iran (60 comments)
Iran Foreign Minister Says Russia Would Give Them Nukes (51 comments)
Experts: Iran Nuclear Program Damaged, Not Destroyed (35 comments)
US Begs China: Don't Let Iran Close Strait of Hormuz (21 comments)
Senator: Vance 'Petty and Unserious' (21 comments)
The Bombing of Iran, the End the War for US, Or Start of It? (20 comments)
Bill Clinton Endorses Andrew Cuomo for Mayor (18 comments)
Trump Has Opened a Pandora's Box (17 comments)