realmagick.com The shrine of knowledge.

# Proths Theorem

Jun 27, 2011 Proth primes: Definition and Status. Proth's Theorem (1878): Let N = k.2n+1 with 2n > k.

Proths Theorem is described in multiple online sources, as addition to our editors' articles, see section below for printable documents, Proths Theorem books and related discussion.

## Suggested Pdf Resources

A generalization of the Proth theorem
LARGE PROTH PRIMES WHEN k = 21 AND k = 25 Curtis Cooper
Definitions and Theorems. Definition 1. A Proth prime is a prime number.
Effective primality tests for integers of the forms <Emphasis Type
Pfaffenbergstr. 95, D-6750 Kaiserslautern, Germany. Abstract.
MERSENNE PRIMES IN IMAGINARY QUADRATIC NUMBER
We will show the following theorem: Date: 30 Elementary prime number theory, imaginary quadratic fields .. To do so, we can use Proth's theorem [10, p.
Some remarks and questions about the AKS algorithm and related
Theorem 3.1 Let n and r be positive integers such that (r, n) = 1. Let p be a prime ..

## Suggested Web Resources

Proth's Theorem -- from Wolfram MathWorld
Aug 29, 2011 Weisstein, Eric W. "Proth's Theorem." From MathWorld--A Wolfram Web Resource.
Proth's theorem - Wikipedia, the free encyclopedia