ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P+(n)P^+(n) denote the largest prime factor of nn. For a,b∈[0,1]a,b\in[0,1], define

B(x;a,b):=#{n≤x:P+(n)≤xa, P+(n+1)≤xb}.B(x;a,b):=\#\{n\leq x:P^+(n)\leq x^a,\ P^+(n+1)\leq x^b\}.

Let ρ(t)\rho(t) denote the Dickman–de Bruijn function. Erdős–Pomerance conjecture. For every a,b∈[0,1]a,b\in[0,1],

lim⁡x→∞x−1B(x;a,b)=ρ(1a)ρ(1b).\lim_{x\rightarrow\infty}x^{-1}B(x;a,b)=\rho\left(\frac{1}{a}\right)\rho\left(\frac{1}{b}\right).

This formalizes the conjectured independence of the largest prime factors of consecutive integers and implies the Erdős–Turán conjecture. Its resolution status is not specified in the supplied text, and it remains open here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.