Search Results for ""
3591 - 3600 of 13135 for Prime NumberSearch Results

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).
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 ...
A conjecture that, as proved by Parshin (1968), implies the Mordell conjecture.
Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...
If a fixed fraction x of a given amount of money P is lost, and then the same fraction x of the remaining amount is gained, the result is less than the original and equal to ...
An algorithm for computing an Egyptian fraction.

...