Search Results for ""

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

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.

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

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.