Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primorial certificate 4493

Proved
TaoFivePrimes.primorial_certificate_4493

by chstdu · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorymertens-theoremnumber-theory

Exact primorial certificate for the primes up to 449344934493:

∏p≤4493,  p primep=Nand∏p≤4493,  p prime(p−1)=D,\prod_{p \le 4493,\; p \text{ prime}} p = N \quad\text{and}\quad \prod_{p \le 4493,\; p \text{ prime}} (p-1) = D,p≤4493,p prime∏​p=Nandp≤4493,p prime∏​(p−1)=D,

with NNN and DDD the two explicit integers stated in the formal statement (a 1917-digit primorial and its shifted product). This is a pure finite data certificate: it anchors the Rosser–Schoenfeld product-bound legs above 450045004500 by supplying the exact value of the Mertens-type product ∏p≤4500p/(p−1)\prod_{p \le 4500} p/(p-1)∏p≤4500​p/(p−1)'s numerator and denominator at the checkpoint prime 449344934493, the largest prime ≤4500\le 4500≤4500.

Preamble
import Mathlib.NumberTheory.PrimeCounting
Formal statement
namespace TaoFivePrimes
theorem primorial_certificate_4493 :
    ∏ p ∈ Nat.primesLE 4493, (p : ℕ) = 154538384872666018323632009495551272757909237514517502369722177507664050977692825430313028076772381944144041698512981244638531639772788077945759098030440575235639372363823714551379653536529131308318092753294939109353090179664000275256551549707765030239320532803520046095990914794568645585457140827863740762043967931923952954145564641162811856178265005557909234379776917847344945204501015981851056264000658659073172308287581951081634882324502599895371532886359091762963220447803302559973301197314909601535890229012285967040540641966675970891858138753732145081862078674809760481870639257824072716271675847792405754780564079522028552372524629386410548563441931774516023658093746010233873680442526575511595753540249300555268893403360450739861940347831016864065401736061987533760891025470904771359354705195443190877516149398053324042859657294420709527228316498465782890254300406688483541479354452946365578452088730448025010614642680374577425673853880206098180379136686709483555956464728741753743963998370774141131662674571160018119242728456348419264193248283824256720405239274772927898881602190621605349816610516677028157390226442753362180514189607021471847917318558496435885560817672744725821092417848734434739911804203364598702775918478230478367256845755906505264812851191987706609687335287735185395622616188976067364310190309836252791168226659213022945053676548032644641531316670917766059892322823985604366926592174416606022743262725884967750191753470645144454633935789765310391194329804486002393830214465703982014365174091011185420863032054820245694528694369302087331310910405737039072770229885376513972117585017767280444272002093402494639059753791845084461610834943866078396584128769479869906069923267036361519487672424517458176514834465870063351624403259570840303230723617427832212717008396671372712409114832150580926625792547080848001656475949139530061636562797621503724914108206977191992702534749320749525211385130 ∧
        ∏ p ∈ Nat.primesLE 4493, ((p : ℕ) - 1) = 10298214862093091259912014251179716850960429478946817584469445609404656855560981587086702457013382828465616122191273034087331468214462407981356972742328999267112101292894809053826243366994808790888293832198235795324655456213851944372556986791765506400954889790119309265135960870118416405338818269407831579322940632804869091546415206155810517629626826158237810685382132563094017356328711086373860959559240595374846813837148419799424488693326527684831646814844747053619420871769637239555905865712547452796859850199063774456458865108944767031478605563400501326308927134177338411350421008910260961794837703349841294424809793401759895839918199892435679415519394588224949790453096997921404278074459198957949696559077246865171000573959934661889662229485515538522550347513012996167791739804765285700551544945991924824562952778302162362393255517470098432872593058401980161177530474729249991370938203957351695093127328322594711716564071151447915933505214966054784333842482211515530925754144349466831322121758233106754353550820105187629329606185497448942620450159704554130284384813931938600400249745089482826723006591425403714623241568733136857126271817978160657977751510113285908752320447584164737758028865317505107173849108592738592887768119157261819754760231793619739052818564452758590684064714212864911569514663854206823367950323001835375964413152793098599312169352321233234749051984174004586201620369110744702621544494043451773187554749951902650473844648695493276662017072030445232480436637604060949749094676940301661110555958329963564401891429460467836344656855903640771694600312411318006881341131597134011987509346752127516872090565137045422153887254646514287621993917486936349708496139484004874651687550750403921870527567976623767552000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
:= by sorry
end TaoFivePrimes
Source
Rosser–Schoenfeld 1962, Approximate formulas for some functions of prime numbers; certificate computed by exact integer arithmetic over the primes p≤4493p \le 4493p≤4493.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me