GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Pocklington's Theorem -- from Wolfram MathWorld

Search

Pocklington's Theorem


Let n-1=FR where F is the factored part of a number

 F=p_1^(a_1)...p_r^(a_r),
(1)

where (R,F)=1, and R<sqrt(n).

Pocklington's theorem, also known as the Pocklington-Lehmer test, then says that if there exists a b_i for i=1, ..., r such that

 b_i^(n-1)=1 (mod n)
(2)

and

 GCD(b_i^((n-1)/p_i)-1,n)=1,
(3)

then n is prime.


See also

Pocklington's Criterion

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • primality testing
  • apply image dilation to The Office image
  • CNF (P && ~Q) || (R && S) || (Q && R && ~S)

Cite this as:

Weisstein, Eric W. "Pocklington's Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PocklingtonsTheorem.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.