Search Results for ""

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...

An algebraic identity is a mathematical identity involving algebraic functions. Examples include the Euler four-square identity, Fibonacci identity, Lebesgue identity, and ...

Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...

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 sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...

The Machin-like formula 1/4pi=2cot^(-1)(2)-cot^(-1)(7). The other 2-term Machin-like formulas are Euler's Machin-like formula, Hutton's formula, and Machin's formula.

The Machin-like formula 1/4pi=2cot^(-1)(3)+cot^(-1)(7). The other two-term Machin-like formulas are Euler's Machin-like formula, Hermann's formula, and Machin's formula.