Search Results for ""

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

Vorobiev's theorem states that if F_l^2|F_k, then F_l|k, where F_n is a Fibonacci number and a|b means a divides b. The theorem was discovered by Vorobiev in 1942, but not ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

The set of natural numbers (the positive integers Z-+ 1, 2, 3, ...; OEIS A000027), denoted N, also called the whole numbers. Like whole numbers, there is no general agreement ...

A sphenic number is a positive integer n which is the product of exactly three distinct primes. The first few sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114, ... ...

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...

Let K be a number field, then each fractional ideal I of K belongs to an equivalence class [I] consisting of all fractional ideals J satisfying I=alphaJ for some nonzero ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

A number of the form +/-sqrt(a), where a is a positive rational number which is not the square of another rational number is called a pure quadratic surd. A number of the ...

A regular number, also called a finite decimal (Havil 2003, p. 25), is a positive number that has a finite decimal expansion. A number such as 1/3=0.33333... which is not ...