Minimum coprime adjacencies in permutationsResearch Paper
Among all permutations of 1 through , let be the smallest possible number of adjacent pairs with greatest common divisor 1. The goal proves the exact value for every .
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.
Among all permutations of 1 through , let be the smallest possible number of adjacent pairs with greatest common divisor 1. The goal proves the exact value for every .
For real let be the Mellin transform of the modulated Gaussian , with . This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…
For real let be the Mellin transform of the modulated Gaussian , with . This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…
For real let be the Mellin transform of the modulated Gaussian , with . This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…
For real let be the Mellin transform of the modulated Gaussian , with . This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…
For real let be the Mellin transform of the modulated Gaussian , with . This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…
Let be Buchstab's function: continuous on , equal to on , and satisfying for ; here it is extended by below . For a box the Buchstab integral is
Let be Buchstab's function: continuous on , equal to on , and satisfying for ; here it is extended by below . For a box the Buchstab integral is
A classical theorem of Fermat states that no four squares form an arithmetic progression over the integers; equivalently, among four consecutive terms of a non-constant integer arithmetic progression, at most three are perfect squares. This raises a quantitative question: how many squares can appear among the first terms of a non-constant arithmetic…
An integral lattice is a discrete additive structure equipped with a pairing that measures lengths and angles. Some lattices satisfy two strong arithmetic conditions simultaneously: every squared length is even, and the pairing has determinant one. The classification of these even unimodular lattices in rank gives a finite collection of arithmetic…
A hash table stores keys in an array and uses a hash value to choose where to begin searching for a free slot. Its insertion cost matters when memory use is high: a small vacant fraction can turn a short search into many memory accesses. Quadratic probing searches at square offsets from the hash. Introduced by Maurer in 1968, it has a long history of use,…
An expander graph supports walks that move through a large state space while using few random choices per step. Local access matters when a vertex has an -bit name: a graph on vertices is useful to an algorithm only if its next neighbor can be computed without first constructing the entire graph. A compatible hierarchy adds another requirement. A walk…
Toom–Cook- multiplication splits each of two long integers into pieces, reads the pieces as the coefficients of two polynomials of degree , evaluates both polynomials at points, multiplies the values pointwise, and recovers the coefficients of the product polynomial by interpolation. The scheme underlies the mid-range multiplication routines…
The uniform all-Dirichlet baseline for Towards the Generalized Riemann Hypothesis.
The Odd Goldbach campaign asks how many prime summands suffice to represent every odd integer greater than one, while tracking bounds supported by formal proofs. This mission supplies the bound 23. Its starting point is the accepted 25-prime formalization, which uses the elementary Schnirelmann–Mann method and explicit sieve estimates. The improvement…
This campaign entry establishes the bound 25 for every odd integer greater than 1, with repetitions allowed. It refines xuanji's existing formalized 27-prime Schnirelmann–Mann argument by replacing the two-prime sum count n/25 with 100n/2399. The middle range is covered by 278 exact rational interval certificates; the large-range final comparison has an…
A partition of a nonnegative integer is a way to express it as a sum of positive integers, with the order of the summands ignored. For example, the partitions of 4 are 4, 3+1, 2+2, 2+1+1, and 1+1+1+1. If denotes their number, then and , with the empty partition counted once. Although this definition is elementary, the values of obey…
This project gives a completed Lean 4/mathlib formalization of the main theorem of A uniform bound of five for Diophantine tuples in imaginary quadratic integer rings by Zrinka Franušić and Tomislav Pejković.
A permutation of in the sense of Erdős and Graham is a one-sided arrangement in which every integer appears exactly once. Erdős Problem 195 (erdosproblems.com/195) asks for the largest such that every such arrangement contains a monotone -term arithmetic progression: indices for which …
The value of a Dirichlet -function at controls class numbers of quadratic fields, the least quadratic non-residue, and the distribution of primes in arithmetic progressions. For a real character modulo the size of is governed by the zeros of near : a real zero close to (a Siegel zero) would make abnorm…
The main conjecture of Iwasawa theory is an identity between two objects attached to an odd prime and the tower of cyclotomic fields : an algebraic object built from the -parts of their ideal class groups, and an analytic object, the Kubota–Leopoldt -adic -function, which interpolates special values of Dirichlet -functions…
The Selmer group is the main computable invariant attached to the rational points of an elliptic curve (more generally, of an abelian variety) over a number field. J. W. S. Cassels named it in honour of E. S. Selmer, whose numerical work on the curves exposed the limits of descent methods (Selmer 1951). For an elliptic curve over a number…
A real number is normal in base when every block of base- digits occurs in its expansion with limiting frequency , exactly as it would in a sequence of independent uniformly random digits. It is normal (absolutely normal) when it is normal in every base . Whether the classical constants of analysis, above all , are normal is one of the…
A real number is normal in base when every block of base- digits occurs in its expansion with limiting frequency , as it would in a sequence of independent uniformly random digits. Borel introduced the notion in 1909 and proved that almost every real number is normal in every base, by an argument that produces no example. This mission collects…
This entry records a completed elementary result in the campaign on odd numbers as sums of primes: every odd natural number greater than 1 is a sum of at most 4401 primes. It illustrates how an additive density estimate can reduce the number of prime summands in a Schnirelmann argument.