Search Results for ""

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.

A conjecture that, as proved by Parshin (1968), implies the Mordell conjecture.

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

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 ...

sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...