Drudge Retort: The Other Side of the News

Drudge Retort

User Info

snoofy

Subscribe to snoofy's blog Subscribe

Menu

Special Features

Comments

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
 

Home | Breaking News | Comments | User Blogs | Stats | Back Page | RSS Feed | RSS Spec | DMCA Compliance | Privacy