Proth's theorem (Q3771212)

primality test for Proth numbers

Language	Label	Description	Also known as
default for all languages	No label defined
English	Proth's theorem	primality test for Proth numbers

Statements

instance of

primality test

1 reference

imported from Wikimedia project

0 references

language of work or name

0 references

0 references

0 references

1878

0 references

defining formula

(\forall p \in ℤ^{+}) (\exists a, k, n) p = k \cdot 2^{n} + 1 \land k ∤ 2 \land k < 2^{n} \land a^{k 2^{n - 1}} \equiv - 1 (\mod p) \Rightarrow p is prime

0 references

(\exists a) a^{\frac{p - 1}{2}} \equiv - 1 (\mod p) \Rightarrow p is prime

reason for preferred rank

most frequent value

0 references

in defining formula

p

0 references

applies to jurisdiction

United States

determination method or standard

published more than 95 years ago

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

Identifiers

1 reference

28 October 2013

Proth's Theorem

1 reference

imported from Wikimedia project

English Wikipedia

Microsoft Academic ID (discontinued)

2777453196

0 references

Proth's theorem (Q3771212)

Statements

Identifiers

Sitelinks

Wikipedia(12 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)