ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p1,…,pkp_1,\ldots,p_k be distinct primes, and let vp(n!)v_p(n!) denote the exponent of pp in the prime factorization of n!n!. Sun's conjecture. There are infinitely many positive integers nn such that

vp1(n!):vp2(n!):⋯:vpk(n!)=1p1−1:1p2−1:⋯:1pk−1.v_{p_1}(n!): v_{p_2}(n!): \cdots: v_{p_k}(n!) = \frac{1}{p_1-1}: \frac{1}{p_2-1}: \cdots: \frac{1}{p_k-1}.

The conjecture concerns simultaneous asymptotic relationships among factorial valuations at distinct primes and is relevant to the preceding question about the full-range condition for last significant digits of factorials in composite bases. Its resolution status is not established by the supplied text.

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.