Sequences of consecutive factoradic happy numbers
Joshua Carlson, Eva G. Goedhart, and Pamela E. Harris

TL;DR
This paper studies special fixed points and happy numbers based on factorial base representations, proving all positive integers are 1-happy and showing the existence of long sequences of happy numbers for certain parameters.
Contribution
It introduces the concept of e-power factoradic fixed points and happy numbers, proving all positive integers are 1-happy and establishing the existence of arbitrarily long sequences for 2 to 4.
Findings
All positive integers are 1-power factoradic happy.
Existence of arbitrarily long sequences of e-power factoradic p-happy numbers for 2≤e≤4.
Fixed points greater than 1 appear in consecutive pairs.
Abstract
Given a positive integer , the factorial base representation of is given by , where and for all . For , we define by and , for . For , we let denote the -th iteration of , while . If satisfies , then we say that is an -power factoradic fixed point of . Moreover, given , if is an -power factoradic fixed point and if there exists such that , then we say that is an -power factoradic -happy number. Note an integer is said to be an -power factoradic happy number if it is an -power factoradic…
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.
