Search Results for ""

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

A requirement necessary for a given statement or theorem to hold. Also called a condition.

One name for the figure used by Euclid to prove the Pythagorean theorem.

A numeral is a symbol used to represent a number. Arabic numerals (0-9) are the ones most commonly used today. Other types, mainly of historical interest, include Egyptian, ...

Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...