Sequences of Consecutive Happy Numbers in Negative Bases
Abstract
For b≤ -2 and e ≥ 2, let Se,b:Z≥ 0 be the function taking an integer to the sum of the e-powers of the digits of its base b expansion. An integer a is a b-happy number if there exists k∈Z+ such that S2,bk(a) = 1. We prove that an integer is -2-happy if and only if it is congruent to 1 modulo 3 and that it is -3-happy if and only if it is odd. Defining a d-sequence to be an arithmetic sequence with constant difference d and setting d = (2,b - 1), we prove that if b ≤ -3 odd or b ∈ \-4,-6,-8,-10\, there exist arbitrarily long finite sequences of d-consecutive b-happy numbers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.