Search Results for ""

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

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 ...

A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...

For a given signal, the power spectrum gives a plot of the portion of a signal's power (energy per unit time) falling within given frequency bins. The most common way of ...

A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...

The power of a fixed point A with respect to a circle of radius r and center O is defined by the product p=AP×AQ, (1) where P and Q are the intersections of a line through A ...

A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...

In his Meditationes algebraicae, Waring (1770, 1782) proposed a generalization of Lagrange's four-square theorem, stating that every rational integer is the sum of a fixed ...

An odd power is a number of the form m^n for m>0 an integer and n a positive odd integer. The first few odd powers are 1, 8, 27, 32, 64, 125, 128, 216, 243, 343, 512, ... ...

Let a, b, and k be integers with k>=1. For j=0, 1, 2, let S_j=sum_(i=j (mod 3))(-1)^i(k; i)a^(k-i)b^i. Then 2(a^2+ab+b^2)^(2k)=(S_0-S_1)^4+(S_1-S_2)^4+(S_2-S_0)^4.