Search Results for ""

The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...

The sequence of Fibonacci numbers {F_n} is periodic modulo any modulus m (Wall 1960), and the period (mod m) is the known as the Pisano period pi(m) (Wrench 1969). For m=1, ...

A quotient-difference table is a triangular array of numbers constructed by drawing a sequence of n numbers in a horizontal row and placing a 1 above each. An additional "1" ...

Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...

A diagram lemma which states that the above commutative diagram of Abelian groups and group homomorphisms with exact rows gives rise to an exact sequence This commutative ...

A solid of revolution is a solid enclosing the surface of revolution obtained by rotating a 1-dimensional curve, line, etc. about an axis. A portion of a solid of revolution ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...

The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...