Generalized 3x + 1 Mappings : counting cycles
Robert Tremblay
TL;DR
This paper investigates generalized 3x+1 mappings and proves that the number of cycles in two specific problems within this family can be finite, contributing to understanding their long-term behavior.
Contribution
It establishes the finiteness of cycles for two problems in the generalized 3x+1 mappings family, a novel result in this area.
Findings
Number of cycles can be finite in these problems
Provides new insights into generalized 3x+1 mappings
Advances understanding of cycle structures in these mappings
Abstract
We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Digital Media Forensic Detection