Topics Register • News • History • How to • Sequences statistics • Template prototypes

# Generalized Fermat number

There are different kinds of generalized Fermat numbers.

## John Cosgrave

John Cosgrave has studied the following numbers:

Numbers of the form: $F_{n,r} = \sum_{i=0}^{p-1} \ 2^{i p^{n}} \ = \ 2^{(p-1)p^n}+2^{(p-2)p^n}+...+2^{2p^n}+2^{p^n}+1 \ = \ (2^{p^{n+1}}-1)/(2^{p^n}-1)$ where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equal to 0.

$F_{0,r}$ generates the Mersenne numbers.
$F_{n,1}$ generates the Fermat numbers.
$F_{n,2}$ generates the Saouter numbers.

Cosgrave has proven the following properties:

1. If number $\sum_{i=0}^{p-1}\ (2^i)^{m} \$ is prime, then $m=p^n$.
2. $F_{n,r}$ numbers are pairwise relatively prime within a rank and across ranks: $gcd(F_{n,i},F_{m,j}) =1$ for all n, m, i and j.
3. They satisfy a product property like Fermat numbers have. And every $F_{n,r}$ passes Fermat's test to base 2.

Saouter has proven that $F_{n,2}$ numbers can be proven prime by using Pépin's test with k=5.

## Dubner

In 1985, Dubner for the first time built a list of large primes of the form: b2m+1, b ≥ 2 and m ≥ 1.