Search Results for ""

An integer n which is tested to see if it divides a given number.

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

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