Search Results for ""

A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying ...

The Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...

As Lagrange showed, any irrational number alpha has an infinity of rational approximations p/q which satisfy |alpha-p/q|<1/(sqrt(5)q^2). (1) Furthermore, if there are no ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...

The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...