ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C{\mathcal{C}} be the classical Collatz map, and let the stopping time of an integer be the least iterate at which it reaches 11. For fixed integers a,b≥0a,b\geq 0, consider the sequence of stopping times associated with the numbers (2a3b)n+1(2^a3^b)^n+1. The arithmetic-progression conjecture. This sequence contains arithmetic sequences of unbounded length, with common difference a−ba-b. The source describes this as a conjecture motivated by an observed phenomenon for sequences such as 2n+12^n+1; 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 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.