ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be an odd integer with q≥5q\geq 5, let xx be a positive integer in Zcq\mathbb Z_{cq}, and let Fq(x)F_q(x) be the modified Collatz general function. Undecidability conjecture for the algorithm qn+1qn+1. There is no algorithm which, given qq and xx, determines whether there exists a positive integer kk such that

Fqk(x)=2q−1.F_q^k(x)=2q-1.

This conjecture concerns the possible undecidability of the generalized Collatz problem; the paper presents it as an open problem motivated by Conway's undecidability theorem for generalized Collatz functions.

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.