Search Results for ""

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

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.