ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let S(n)S(n) be the smallest positive integer jj such that nn divides j!j!. Sondow's conjecture. The inequality

n2<S(n)!n^2<S(n)!

holds for almost all positive integers nn. The paper proves the stronger assertion that, for every fixed real number k>1k>1, nk<S(n)!n^k<S(n)! holds for almost all positive integers nn, so this conjecture is resolved.

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.