ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers N,q,aN,q,a, let

Q(N;q,a)=#{ n∈Z:0≤n≤N−1, qn+a is a perfect square },Q(N;q,a)=\#\{\,n\in\mathbb{Z}: 0\le n\le N-1,\ qn+a \text{ is a perfect square}\,\},

that is, the number of perfect squares among the NN terms a, q+a, 2q+a, …, (N−1)q+aa,\ q+a,\ 2q+a,\ \ldots,\ (N-1)q+a of the arithmetic progression qn+aqn+a, and set

Q(N)=max⁡{ Q(N;q,a):q≥1, a≥1 }.Q(N)=\max\{\,Q(N;q,a): q\ge 1,\ a\ge 1\,\}.

Then:

  1. Q(N)=O ⁣(N)Q(N)=O\!\left(\sqrt{N}\right), i.e. there is an absolute constant C>0C>0 with Q(N)≤CNQ(N)\le C\sqrt{N} for every positive integer NN.

  2. (Strong form) For every integer N>6N>6,

Q(N)=Q(N;24,1),Q(N)=Q(N;24,1),

so that the maximum number of squares in an NN-term arithmetic progression is attained by the progression 24n+124n+1, whose terms 24n+124n+1 are squares exactly when nn is a generalized pentagonal number.

  1. (Super-strong form) If N=GPk+1≥8N=GP_k+1\ge 8, where GPkGP_k denotes the kk-th generalized pentagonal number, then the progression 24n+124n+1 is, up to equivalence, the only arithmetic progression of length NN with Q(N;q,a)=Q(N)Q(N;q,a)=Q(N); here two progressions qn+aqn+a and q′n+a′q'n+a' of length NN are equivalent when one is obtained from the other by a common square factor, i.e. (q′,a′)=(d2q,d2a)(q',a')=(d^2q,d^2a) for some positive integer dd, and by reversing the order of the NN terms.

Record

Added
Links

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.