Search Results for ""

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...

There are so many theorems due to Fermat that the term "Fermat's theorem" is best avoided unless augmented by a description of which theorem of Fermat is under discussion. ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...

The compositeness test consisting of the application of Fermat's little theorem.

A sequence of primes q_1<q_2<...<q_k is a Cunningham chain of the first kind (second kind) of length k if q_(i+1)=2q_i+1 (q_(i+1)=2q_i-1) for i=1, ..., k-1. Cunningham primes ...

Number Theory

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...