ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,m,kn,m,k be positive integers with m≥2m\geq 2. For a positive integer, its base-mm expansion is the representation using digits from 00 through m−1m-1; a non-zero digit is a digit in this expansion that is not 00.

Sun's conjecture. (I) There are at least kk non-zero digits in the base-mm expansion of

mk−1m−1n.\frac{m^k-1}{m-1}n.

(II) The sum of all digits in the base-mm expansion of

(mk−1)n(m^k-1)n

\nis at least k(m−1)k(m-1).

These assertions generalize Sun's results for binary expansions and for prime bases, giving digit-expansion lower bounds for products involving geometric sums and mk−1m^k-1.

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.