On consecutive happy numbers

Abstract

Let e>=1 and b>=2 be integers. For a positive integer n=Σj=0kajbj with 0<=aj<b, define Te,b(n)=Σj=0kaje. n is called (e,b)-happy if Te,br(n)=1 for some r>=0, where Te,br is the r-th iteration of Te,b. In this paper, we prove that there exist arbitrarily long sequences of consecutive (e,b)-happy numbers provided that e-1 is not divisible by p-1 for any prime divisor p of b-1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…