Happy numbers

From Fōrmulæ wiki
Jump to: navigation, search

This page is the answer to the task Happy numbers in the Rosetta Code.

Description (from Rosetta Code)

From Wikipedia, the free encyclopedia:
A happy number is defined by the following process:
Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers.

Display an example of your output here.


Find and print the first 8 happy numbers.

See also


The following is a function to test whether a number is happy or not:

Happy numbers01.png

The next code is to create a list of happy numbers:

Happy numbers02.png

Test Case

Happy numbers03.png