ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers hh and kk, define

S(h,k):=∑j=1k−1(−1)j+1+⌊hj/k⌋,S(h,k):=\sum_{j=1}^{k-1}(-1)^{j+1+\lfloor hj/k\rfloor},

where ⌊x⌋\lfloor x\rfloor is the greatest integer less than or equal to xx, and define

S(k):=∑h=1k−1S(h,k).S(k):=\sum_{h=1}^{k-1}S(h,k).

Let C1C_1 and C2C_2 be any fixed positive numbers, and let ϵ>0\epsilon>0 be fixed. Near-linear growth conjecture. For all sufficiently large primes kk,

C1k<S(k)<C2k1+ϵ.C_1k<S(k)<C_2k^{1+\epsilon}.

The conjecture is motivated by numerical fits suggesting growth slightly greater than linear, with an observed best-fit slope of approximately 5.75.7. It asserts a linear lower bound and an upper bound arbitrarily close to linear up to the factor kϵk^\epsilon, but remains unproved.

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.