One consequence of it is that any composite number n has a witness less than 70 times the quantity natural log of n squared.
One consequence of it is that any composite number n has a witness less than 70 times the quantity natural log of n squared. The Odlyzko-Schönhage algorithm has been used to verify it for over ten trillion values (*), and it is equivalent to stating that the de Bruijn constant is less than or equal to zero. Louis De Branges de Bourcia of Purdue claimed to have a proof of it in 2004, even though the related Mertens conjecture has been proven false. FTP, name this yet-unproven hypothesis, number 8 Hilbert's list, which states that the real part must equal ½ for any positive zero of a namesake Zeta function.
One consequence of it is that any composite number n has a witness less than 70 times the quantity natural log of n squared.
{Riemann} hypothesis