Proth Number Calculator

k·2^n + 1 primes

All Tools

Loading tool...

About Proth Number Calculator

A Proth number calculator generating numbers of the form k·2^n + 1 with k odd and k < 2^n. Proth's theorem provides a deterministic primality test: if a^((P-1)/2) ≡ −1 (mod P) for some a, then P is prime. Shows generation and primality testing. Client-side.

Proth Number Calculator Features

  • Proth generation
  • Primality test
  • Proth's theorem
  • k and n inputs
  • Sequence
Advertisement
Advertisement