Rudin's conjecture
Statement
For positive integers , let
that is, the number of perfect squares among the terms of the arithmetic progression , and set
Then:
-
, i.e. there is an absolute constant with for every positive integer .
-
(Strong form) For every integer ,
so that the maximum number of squares in an -term arithmetic progression is attained by the progression , whose terms are squares exactly when is a generalized pentagonal number.
- (Super-strong form) If , where denotes the -th generalized pentagonal number, then the progression is, up to equivalence, the only arithmetic progression of length with ; here two progressions and of length are equivalent when one is obtained from the other by a common square factor, i.e. for some positive integer , and by reversing the order of the terms.
Record
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.