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).

Stronger linear lower-bound conjecture. For each prime k>3119k>3119,

S(k)>3k.S(k)>3k.

This is a further numerical strengthening of the preceding lower bound. The source reports that the primes up to 1000010000 failing S(k)<3kS(k)<3k have largest value 31193119, but gives no proof of the conjecture.

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.