ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Denote by AnA_n the least common multiple of the integers {1,2,...,n}\{1, 2, ..., n\} and let pkp_k denote the kthk^{\mathrm{th}} prime. Almost certainly Apk+1−1<pkApkA_{p_{k+1}-1} < p_k A_{p_k} must hold for every kk but the proof of this is certainly beyond our ability [...]. In fact, if An′A_n' denotes the least common multiple of the numbers pα⩽np^{\alpha} \leqslant n with α⩾2\alpha \geqslant 2 then An+[n]′/An′<nA_{n+[\sqrt{n}]}'/A_n' < n seems extremely unlikely to us.

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.