An extension of Wilson's Theorem

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

The aim of this work is to optimize the existing formula based on Wilson's theorem to reduce themagnitude of the computation results. Wilson's theorem states: if p is a prime number, then (p − 1)! + 1 is divisible by p.The function (p − 1)! increases very rapidly and reaches huge values.When the values of p are large, the calculations become resource-intensive, so it is necessary to reduce the upper limit of the calculation results.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0