Search Results for ""

An algorithm for computing an Egyptian fraction.

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

Two numbers which are relatively prime.

The Machin-like formula 1/4pi=cot^(-1)2+cot^(-1)5+cot^(-1)8.

If a sequence has the property that the block growth function B(n)=n+1 for all n, then it is said to have minimal block growth, and the sequence is called a Sturmian ...

A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...

The operation of multiplication, i.e., a times b. Various notations are a×b, a·b, a*b, ab, and (a)(b). The "multiplication sign" × is based on Saint Andrew's cross (Bergamini ...

A ring of fractions that coincides with the localization with respect to the set of all non-zero divisors.