Search Results for ""

Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...

The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...

A generalization of Fermat's little theorem. Euler published a proof of the following more general theorem in 1736. Let phi(n) denote the totient function. Then a^(phi(n))=1 ...

Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...

If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Then {U_((n-(D/n))/2)=0 (mod n) when (Q/n)=1; V_((n-(D/n))/2)=D (mod n) when (Q/n)=-1, ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

Let q be a positive integer, then Gamma_0(q) is defined as the set of all matrices [a b; c d] in the modular group Gamma Gamma with c=0 (mod q). Gamma_0(q) is a subgroup of ...

A link L is said to be splittable if a plane can be embedded in R^3 such that the plane separates one or more components of L from other components of L and the plane is ...