Search Results for ""

F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...

The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...

The ratio of two numbers r and s is written r/s, where r is the numerator and s is the denominator. The ratio of r to s is equivalent to the quotient r/s. Betting odds ...

z^p-y^p=(z-y)(z-zetay)...(z-zeta^(p-1)y), where zeta=e^(2pii/p) (a de Moivre number) and p is a prime.

alpha is called a predecessor if there is no ordinal number beta such that beta+1=alpha.

omega^epsilon=epsilon, where omega is an ordinal number and epsilon is an inaccessible cardinal.

A very large number defined in terms of circle notation by Steinhaus (1983) as .

A system is singular if its condition number is infinite and ill-conditioned if it is too large.

The number 1. There are n nth roots of unity, known as the de Moivre numbers.