On the Density of Happy Numbers

Abstract

The happy function H: N → N sends a positive integer to the sum of the squares of its digits. A number x is said to be happy if the sequence \Hn(x)\∞n=1 eventually reaches one. A basic open question regarding happy numbers is what bounds on the density can be proved. This paper uses probabilistic methods to reduce this problem to experimentally finding suitably large intervals containing a high (or low) density of happy numbers as a subset. Specifically we show that d > .18577 and d < .1138. We also prove that the asymptotic density does not exist for several generalizations of happy numbers.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…