ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n>1n>1 be a positive integer, and let pp be the smallest prime divisor of nn. For positive integers nn and kk, let

h(n,k)=min⁡{h(S)∣∣S∣=n+k},h(n,k)=\min\{h(S)\mid |S|=n+k\},

where SS ranges over sequences in Zn\mathbb{Z}_n of length n+kn+k such that 0∉∑n(S)0\notin\sum_n(S). Lower-bound conjecture. If k≥(n/p)−1k\geq (n/p)-1, then

h(n,k)≥k+1.h(n,k)\geq k+1.

This conjecture extends known lower bounds for h(n,k)h(n,k) and addresses the range in which the previously expected bound has counterexamples. Its status is unresolved in the supplied source.

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.