ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bb and mm be the parameters defining the generalized Collatz map, and let (Sk)(S_k) be the sequence obtained by iterating this map from an arbitrary positive integer. Generalized Collatz conjecture. If m=b−1m=b-1, the sequence (Sk)(S_k) shall eventually reach the number 11, irrespective of which positive integer is chosen initially.

This conjecture extends the original Collatz assertion to the specified parameter family. The source reports computational searches and counterexamples for several other parameter choices, but gives no proof for the case m=b−1m=b-1; its status is therefore open.

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.