Search Results for ""

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

An algorithm for computing an Egyptian fraction.

If the Taniyama-Shimura conjecture holds for all semistable elliptic curves, then Fermat's last theorem is true. Before its proof by Ribet in 1986, the theorem had been ...

The divisibility test that an integer is divisible by 9 iff the sum of its digits is divisible by 9.

The Rutherford constant is a mathematical constant that arises in plasma physics and is defined by K_R = sqrt(2)int_(-1)^infty([R(x)]^2)/(S[x])dx (1) = 0.8227..., (2) where ...

The Sally sequence gives the sequence of lengths of the repetitions which are avoided in the Linus sequence. The first few terms are 0, 1, 1, 2, 1, 3, 1, 1, 3, 2, 1, 6, 3, 2, ...

An archaic unit fraction variously defined as 1/200 (of an hour), 1/10 or 1/12 (of an inch), 1/12 (of a celestial body's angular diameter), or 1/60 (of an hour or degree).

When a prime l divides the elliptic discriminant of a elliptic curve E, two or all three roots of E become congruent (mod l). An elliptic curve is semistable if, for all such ...

An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.