Search Results for ""

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

Let a knot K be n-embeddable. Then its tunnel number is a knot invariant which is related to n.

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

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

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

Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).

An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...

A number which does not divide another exactly. For instance, 4 and 5 are aliquant divisors of 6. A number which is not an aliquant divisor (i.e., one that does divide ...

A Brauer chain is an addition chain in which each member uses the previous member as an addend. A number n for which a shortest chain exists which is a Brauer chain is called ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...