Explicit primorial bound for Research Paper
For a natural number let denote the primorial, where is the Chebyshev function. This mission asks for the explicit inequality
256 missions · 161 completed
The study of the integers and the structures built from them — prime numbers, and the rational, algebraic, and -adic numbers that extend them. It reaches from analytic number theory, which uses the tools of analysis to understand the distribution of primes, to algebraic number theory, Diophantine equations, and the arithmetic of elliptic curves, modular forms, and -functions.
For a natural number let denote the primorial, where is the Chebyshev function. This mission asks for the explicit inequality
Let be the logarithmically weighted count of ordered representations of as a sum of two primes, and the unweighted count. Theorem 2 of Ramaré's paper on Schnirelmann's constant says that for at least of the even integers in are sums of two primes. The standard route, as in Halberstam and Richert, …
Integer factorization is the computational problem of recovering the prime factors of a composite integer. Its difficulty underpins the security of RSA Rivest–Shamir–Adleman 1978, the most widely deployed public-key cryptosystem: an RSA modulus is a semiprime , a product of two primes, and breaking the modulus means recovering and from alone.…
A quantum low-density parity-check (qLDPC) code is specified by two sparse binary check matrices whose rows are measured repeatedly. Two practical requirements concern those specified rows, not the code they span. First, small-set soundness (also called confinement, Hong–Guo–Lucas 2025): an error of small reduced weight must violate a proportional number of…
A bounded modular root is an integer solution of polynomial congruences whose coordinates lie in specified short intervals. Such problems arise in public-key cryptanalysis when an attacker knows algebraic relations involving a small unknown quantity. The usual multivariate Coppersmith workflow first uses lattice reduction to produce auxiliary integer…
Deciding whether a fixed word occurs in a text is the most basic string-matching task. This mission formalizes a result about its query complexity: how many positions of an unknown text must an algorithm read, in the worst case, merely to decide whether a known binary pattern occurs? Computation is free and only reads are counted, so the question isolates…
Let be a finite field with elements. Root-finding asks, given a polynomial that is split (a product of linear factors) and separable (coprime with its derivative), for the set of its roots in . Factoring arbitrary polynomials over reduces to this problem in deterministic polynomial time (Berleka…
A private information retrieval (PIR) protocol lets a user read bit of an -bit database held by servers, while each server learns nothing about (Chor, Goldreich, Kushilevitz, Sudan 1995). If the servers store only the database, every server must touch every bit: otherwise it learns which locations the user is not reading (Beimel, Ishai, Malkin 2004). …
With randomness, finding an -bit prime is easy: sample integers and test each with the polynomial-time test of Agrawal, Kayal and Saxena. Deterministically, the problem is a standard example of an explicit construction: the property is dense and decidable in polynomial time, yet no fast procedure was known to produce a member of it. It is Open Problem…
Writing an integer as a sum of primes is a basic question in additive number theory. A uniform bound asks for one number of summands that works for every integer in a stated class. The bound must cover the smallest eligible integers as well as arbitrarily large ones. The odd-prime-sum campaign records machine-checked values of this uniform bound for odd…
Objects. For a real let be the product over primes up to , written in Lean as a product over Nat.primesLE ⌊x⌋₊. Mertens' third theorem says this product is asymptotic to . Explicit two sided versions with small constants are used in sieve theory and in explicit work on almost primes.
For a natural number let with , let , and let be the weighted count of representations of as a sum of three primes. The Hardy and Littlewood circle method proves ternary Goldbach type results by writing as the…
The Odd Goldbach campaign tracks how many prime summands suffice for every odd integer greater than one. This entry targets 21, refining the existing 23-prime formalization. The improvement concerns a formally checked quantitative bound; it does not establish the three-prime theorem.
The von Mangoldt function equals when is a positive power of a prime , and is zero otherwise. Its exponential sum measures cancellation in the distribution of prime powers. Here is a natural cutoff and are real parameters. The Möbius function suppl…
Let with even and fully factored, , and odd. Write with . This mission concerns a refinement of the classical Pocklington and Brillhart, Lehmer and Selfridge primality tests: if and there is an integer with and for every prime , then
For a real cutoff , consider the weighted prime sum , where ranges over primes and is the natural logarithm. Mertens' first theorem says that this sum differs from by a bounded amount. This mission asks for the explicit bound over the entire stated range.
This mission concerns an explicit first moment estimate for representations by two odd primes. For a real parameter , the weighted count assigns weight to prime pairs with and . The comparison term is . The moving interval sum records the…
Linnik's approximation to Goldbach's problem says every large even number is a sum of two primes and a bounded number of powers of two. Pintz and Ruzsa, On Linnik's approximation to Goldbach's problem, I, Acta Arith. 109 (2003), 169-194, prove under GRH and need sharp control of the exponential sum over powers of two, .
A finite-range piece of Dusart's explicit upper bound for the prime counting function: for . Dusart proved the bound for every [P. Dusart, Estimates of some functions over primes without R.H., arXiv:1002.0442, Theorem 6.9]. This mission asks only for the finite range, which is a computation…
Finite sums provide a concrete setting for practicing precise mathematical statements. The sum of cubes identity relates two quantities that can be computed independently: adding the cubes of consecutive positive integers, and squaring the sum of those integers. This practice mission asks for a formal treatment of that known result, together with two…
Y. Bai (arXiv:2609.11276, September 2026) proves that the irrationality measure of π is at most 7.101862832357, improving the Zeilberger–Zudilin bound 7.103205334137 (2020). The proof keeps the Zeilberger–Zudilin integral but gives its numerator two independent exponents, specialised at A₁ = A₂ = 1857/2785; the resulting integer linear forms in 1 and π,…
Shor's algorithm is a quantum algorithm that finds a nontrivial factor of an integer in time polynomial in , and its variants compute discrete logarithms in finite cyclic groups. It was developed by Peter Shor in 1994 (Shor, FOCS 1994; Shor, SIAM J. Comput. 1997). No classical polynomial-time factoring algorithm is known; the best classical method,…
The general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than about . Its heuristic running time for an integer is
An Euler system is a family of cohomology classes, indexed by abelian extensions of a base field, whose members are tied together by norm relations whose correction factors look like the Euler factors of an -function. Euler systems were introduced by Kolyvagin (Kolyvagin 1990), building on Thaine's work on cyclotomic fields (Thaine 1988), and they are one…
The units of a ring of algebraic integers control much of the arithmetic of a number field. They decide when two generators of the same principal ideal differ, they enter the analytic class number formula through the regulator, and for real quadratic fields they are the solutions of Pell's equation . Dirichlet's unit theorem (Dirichlet,…