Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Proth number

From Prime-Wiki
Jump to: navigation, search

In number theory, a Proth number is a number of the form

N = k•2n+1

where k is an odd positive integer and n is a positive integer such that 2n > k.

Without the condition that 2n > k, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too.

A Proth prime is a Proth number, which is prime.

Cullen numbers (n•2n+1) and Fermat numbers (22n+1) are special forms of Proth numbers.

See also

External links

Number classes
General numbers
Special numbers
Prime numbers