Search Results for ""

Andrica's conjecture states that, for p_n the nth prime number, the inequality A_n=sqrt(p_(n+1))-sqrt(p_n)<1 holds, where the discrete function A_n is plotted above. The ...

The prime number theorem shows that the nth prime number p_n has the asymptotic value p_n∼nlnn (1) as n->infty (Havil 2003, p. 182). Rosser's theorem makes this a rigorous ...

Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

A ring for which the product of any pair of ideals is zero only if one of the two ideals is zero. All simple rings are prime.

The prime subfield of a field F is the subfield of F generated by the multiplicative identity 1_F of F. It is isomorphic to either Q (if the field characteristic is 0), or ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

An n×n magic square for which every pair of numbers symmetrically opposite the center sum to n^2+1. The Lo Shu is associative but not panmagic. The numbers of associative ...

An addition-multiplication square is a square of integers that is simultaneously a magic square and multiplication magic square. In 1955, Horner found a square of order eight ...

The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...