Arithmetic-progression conjecture for Collatz stopping times
Statement
Let be the classical Collatz map, and let the stopping time of an integer be the least iterate at which it reaches . For fixed integers , consider the sequence of stopping times associated with the numbers . The arithmetic-progression conjecture. This sequence contains arithmetic sequences of unbounded length, with common difference . The source describes this as a conjecture motivated by an observed phenomenon for sequences such as ; its status is not resolved there.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.