Arratia's divisibility conjecture for prime factors of a uniform random integer
Arratia's divisibility conjecture for prime factors of a uniform random integer
Let be uniformly distributed on , with prime factorization
For each prime , let be an independent geometric random variable with parameter and range , and define
A coupling of and is a joint construction preserving their respective distributions. Arratia's conjecture. For all , it is possible to construct , , and a prime such that
always. Equivalently, there exists a coupling such that
always. The conjecture proposes an especially strong coupling between the dependent prime-factor exponent process of a uniform random integer and its independent geometric limit process; the supplied text does not state whether it has been resolved.
Sources & referencesView supporting material
Primary source
Joseph Squillace, “On the Dependence of the Component Counting Process of a Discrete Uniform Random Variable”, arXiv:1910.12841 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.