Sequences of Consecutive Happy Numbers in Negative Bases
Helen G. Grundman, Pamela E. Harris

TL;DR
This paper investigates the properties of happy numbers in negative bases, establishing specific congruence conditions for -2 and -3 bases and demonstrating the existence of arbitrarily long sequences of consecutive happy numbers in certain negative bases.
Contribution
It characterizes negative-base happy numbers and proves the existence of arbitrarily long sequences of consecutive happy numbers in specific negative bases.
Findings
-2-happy numbers are exactly those congruent to 1 mod 3.
-3-happy numbers are precisely the odd integers.
Existence of arbitrarily long sequences of consecutive happy numbers in certain negative bases.
Abstract
For and , let be the function taking an integer to the sum of the -powers of the digits of its base expansion. An integer is a -happy number if there exists such that . We prove that an integer is -happy if and only if it is congruent to 1 modulo 3 and that it is -happy if and only if it is odd. Defining a -sequence to be an arithmetic sequence with constant difference and setting , we prove that if odd or , there exist arbitrarily long finite sequences of -consecutive -happy numbers.
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
TopicsComputability, Logic, AI Algorithms
