Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

TaoFivePrimes.primorial_certificate_3989

Proved

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

analytic-number-theorymertens-theoremnumber-theory

Exact primorial certificate for the primes up to 398939893989:

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

with NNN and DDD the two explicit integers stated in the formal statement (a 1699-digit primorial and its shifted product). This is a pure finite data certificate: it anchors the Rosser–Schoenfeld product-bound legs above 400040004000 the same way the primorial certificates at 691691691, 104910491049, 149914991499, 199919991999, 247724772477, 299929992999 and 349934993499 anchor the legs below, so that each range leg only has to telescope the Euler product over its own primes instead of re-verifying the primorial from scratch.

Preamble
import Mathlib.NumberTheory.PrimeCounting
Formal statement
namespace TaoFivePrimes
theorem primorial_certificate_3989 :
    ∏ p ∈ Nat.primesLE 3989, (p : ℕ) = 3880296923236642390031130684613452524588886727780664319027347082418733219966244087101295558531559293121299394947611560835694163089195945427062832744292373904387329212065189584655091391380922206501298579624340404074208943892485474076417428630071251667745401779553734071129784664397818507093992093308144488051784694982331627791776066714843158209832803521586677577292951796272695076761923954192593007085781700275331504473845176225341415332396236897779695787731887083843533753942995424846005768303679879228394090791226695439941109590955950110347916979633240721932999592786175161076101745231638532417558333143232593312173455689377621111057575545242799673949001289113712002821870177904862742021616768004726818532762524158559607686977154772380423450801419301571323847939461117821976867327254295967484045225357895700197717663918325892804193926622007441584015317659537897402670285041737960150425137032866175471138343985303653062623809052438250488068067140425404382327096530480022627353383725009787665920913931947297941223442205197531774613204152373247118439022595196902594911277394260963901316020941488532326764081938357649157980534488207736554029752187139400313179907058508773589953849924406841128940672267494371970471991674045883078936750073816391318081584332719372802418655440893778010776605218979929617427665927217007474321165278499292003910489271568365789428412274688413088983324033754562718134407532756612960711201035147001469726640817301739552708562770817823266328412598702082432716222448606970566952919454463325282125277995362069453450577677353923109716293160658606354486646030755892360397157413160186344381219733474295575990084974386644582507097254494924969642983124531582964888190966107876714224170 ∧
    ∏ p ∈ Nat.primesLE 3989, ((p : ℕ) - 1) = 262271182448565707217535771290511490375274213242126801232512620438135612859853987938219533370085140432839678448533497698931354992097818671901986073477167444174734986765106799536630609571886953813338324035256054887735729237717650891110641177422796874797053523035455695049498750664249475455133113859728580053427722241751877653992123525414351055900467653381369754000695428359612115215518579563747079140939989816835724654525994561554897645586395506469058271311639620800469879940196488614291338241525994524381079051147384238156900502824260992471701107451833558152425880468182493992947864830541652541917139445258771801935032738163073821900759070755778025103876088779075508700527561042046698650237198900176103611162696036319709093997522065413476618763423105387993434046154779626204283562283769227392116276243906444696158562358896467237338155679155896564240654170203932202803245164892245661624347871498333505023083079649544505191470067189428289257354495071709592718067876813820475021344687734482299625279216002773733759845939935077037484957896735587273993741990714555694999815137152182932870706038982261387750417572060344227527144019434717514989414479671409991992321280289376766311829051428844219433898286189368657642442893311617720656664437123247604908604532682000741984326027932373475754184931437084944799476538513772522996333344245860034153536705610222331097798698073855053394987451591453164756726499699809102224384314789014968778526082367302524075453659736646738951718130039203244935195517533074504626703228256185729811108325592408260608000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 := by sorry
end TaoFivePrimes
Source
Pure finite computation certificate (companion to TaoFivePrimes.primorial_certificate_691, TaoFivePrimes.primorial_certificate_1049, TaoFivePrimes.primorial_certificate_1499, TaoFivePrimes.primorial_certificate_1999, TaoFivePrimes.primorial_certificate_2477, TaoFivePrimes.primorial_certificate_2999 and TaoFivePrimes.primorial_certificate_3499): the exact values of the primorial ∏p≤3989p\prod_{p\le 3989} p∏p≤3989​p and of ∏p≤3989(p−1)\prod_{p\le 3989}(p-1)∏p≤3989​(p−1), to serve as the verified anchor for the range legs of Rosser–Schoenfeld Theorem 23 (4.10) above 400040004000.

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