Number Theory > Prime Numbers > Primality Testing >

Proth's Theorem

For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that

a^((N-1)/2)=-1 (mod N),

then N is prime. A prime of this form is known as a Proth prime.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

 Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

 Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.
Computerbasedmath.org »

Join the initiative for modernizing math education.

 Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

 Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.
Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

 Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

 Wolfram Language »

Knowledge-based programming for everyone.