Two remarks on the Collatz cycle conjecture

MaRDI QIDQ4689713zbMATH OpenFDO

Authors Masayoshi Kaneda

Publication date 17 October 2018

Full work available at URL https://arxiv.org/abs/1010.6206, https://www.fq.math.ca/Abstracts/53-2/kaneda.pdf

Mathematics Subject Classification ID

Recurrences (11B37) Special sequences and polynomials (11B83)

Abstract: We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.

Recommendations

• scientific article; zbMATH DE number 1751496
• scientific article; zbMATH DE number 2248471
• Some remarks about the Collatz problem
• On the Collatz conjecture
• Collatz conjecture revisited: an elementary generalization
• On the arithmetic of cycles for the Collatz-Hasse (`Syracuse') conjectures
• On generalized circuit of the Collatz conjecture
• scientific article; zbMATH DE number 5263433
• On the orbits associated with the Collatz conjecture

Cited in

(6)

• A linear algebra approach to the conjecture of Collatz
• Results on the \(3x+1\) and \(3x+d\) conjectures
• Effective polynomial upper bounds to perigees and numbers of (3x+d)-cycles of a given oddlength
• Optimal bounds for the length of rational Collatz cycles
• Cyclemaster matrices and Collatz cycles
• Are the Collatz and abc Conjectures Related?

This page was built for publication: Two remarks on the Collatz cycle conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689713)