Search Results for ""

The first few numbers whose abundance absolute values are odd squares (excluding the trivial cases of powers of 2) are 98, 2116, 4232, 49928, 80656, 140450, 550564, 729632, ...

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...

A Lehmer number is a number generated by a generalization of a Lucas sequence. Let alpha and beta be complex numbers with alpha+beta = sqrt(R) (1) alphabeta = Q, (2) where Q ...

A linear congruence equation ax=b (mod m) (1) is solvable iff the congruence b=0 (mod d) (2) with d=GCD(a,m) is the greatest common divisor is solvable. Let one solution to ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

A Liouville number is a transcendental number which has very close rational number approximations. An irrational number beta is called a Liouville number if, for each n, ...