Proth's theorem (Q6481818)

From MaRDI portal
Revision as of 23:18, 17 February 2025 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





primality test for Proth numbers
Language Label Description Also known as
English
Proth's theorem
primality test for Proth numbers

    Statements

    publication date
    1878
    0 references
    author
    François Proth
    0 references
    defining formula
    (∀p∈ℤ+)(∃a,k,n)p=k⋅2n+1∧k∤2∧k<2n∧ak2n−1≡−1(modp)⇒p is prime
    0 references
    (∃a)ap−12≡−1(modp)⇒p is prime
    reason for preferred rank
    generally used form
    0 references

    Identifiers

    Freebase ID
    /m/08_n3k
    1 reference
    stated in
    Freebase Data Dumps
    publication date
    28 October 2013
    Microsoft Academic ID
    2777453196
    0 references
    Wikidata QID
    Q3771212
    0 references
     
      Retrieved from "https://mardi.schubotz.org/w/index.php?title=Item:Q6481818&oldid=40260719"
      Powered by MediaWiki