ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For any k≥2k\geq 2 let gk(n)g_k(n) denote the maximum value of (a1+⋯+ak)−n(a_1+\cdots+a_k)-n where a1,…,aka_1,\ldots,a_k are integers such that a1!⋯ak!∣n!a_1!\cdots a_k! \mid n!. Can one show that ∑n≤xgk(n)∼ckxlog⁡x\sum_{n\leq x}g_k(n) \sim c_k x\log x for some constant ckc_k? Is it true that there is a constant ckc_k such that for almost all n<xn<x we have gk(n)=cklog⁡x+o(log⁡x)?g_k(n)=c_k\log x+o(\log x)?

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.