The fractional 3n+1 conjecture for the Delta-sequence
Statement
Let be the largest integer less than or equal to , and let for . Define
For a seed , define its -sequence by .
The fractional conjecture. Iterating will eventually either converge to zero, or loop over sequences of real numbers whose successive integer parts are
This cycle has length .
The conjecture is a real-valued analogue of the classical Collatz problem. The authors prove it for and state that extending the proof to larger fixed values appears to require increased computational power; a complete proof or refutation remains unresolved.
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.