2011/08/19 by Thomas W. Lynch, Lynch, Thomas W.
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM
paper · pdf · doi:10.48550/arxiv.1108.4056
Write me if you would like a copy of the Mathematica program I used to search against the constraint. There are some variations for the closed form on other cases, write if you would like those. This work was done while I was visiting at the University of the West Indies this summer. I truly enjoyed meeting Dr. Cadogan and studying his Collatz conjecture proofs
arxiv created 2011/08/19 · openalex publication_date 2011/08/19 · arxiv updated 2011/08/23 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
Professor Cadogan at the University of the West Indies identified special starting points that yield long subsequences where the normalization constant, k, is always one. I studied these special sequences and found an implicit mixed integer equation in closed form which if solved would produce seed values in cycling subsequences. Such cycles only occur among extremely large numbers, causing the equation to be difficult to solve numerically.