Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Pépin's test · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Русский 한국어 中文日本語

EntityQ1779493· pop 10· linked from 74 articles

Pépin's test

primality test for Fermat numbers

Connections

division algorithm

multiplication algorithm

Categories

Primality tests

Sources

wikipedia.externallinksexternallink

long division

Entity

digital object identifier

greatest common divisor

sieve of Eratosthenes

Euclidean algorithm

On-Line Encyclopedia of Integer Sequences

integer factorization

Euclidean division

Shor's algorithm

time complexity

Legendre symbol

quadratic reciprocity

Sign in to save

What links here74 pages

Schoof's algorithm

binary GCD algorithm

multiplication algorithm

Lenstra elliptic curve factorization

Ancient Egyptian multiplication

sieve of Eratosthenes

Pollard's rho algorithm for logarithms

Pohlig–Hellman algorithm

Generating primes

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

baby-step giant-step

Sieve of Sundaram

special number field sieve

modular exponentiation

Fermat's factorization method

general number field sieve

discrete logarithm

extended Euclidean algorithm

Lucas–Lehmer primality test

Quadratic sieve

Schönhage–Strassen algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.65

Nylander's test

Entitydist 0.65

Gaenslen's test

Entitydist 0.67

Entitydist 0.68

Entitydist 0.70

Tukey's range test

Entitydist 0.70

Entitydist 0.71

Entitydist 0.71

Entitydist 0.71

high-stakes test

Entitydist 0.72

statistical test

Entitydist 0.72

Fertility testing

Entitydist 0.72