Search Results for ""

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

A conjecture concerning primes.

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

Pre-Algebra

A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...

The extension of a, an ideal in commutative ring A, in a ring B, is the ideal generated by its image f(a) under a ring homomorphism f. Explicitly, it is any finite sum of the ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

Mann's theorem is a theorem widely circulated as the "alpha-beta conjecture" that was subsequently proven by Mann (1942). It states that if A and B are sets of integers each ...