Abstract
In this paper, we investigate the asymptotic behavior of the sequences generated by iterating the process of summing the modular powers of the decimal digits of a number. In particular, we identify all modular happy numbers. A number is called modular happy if the sequence obtained by iterating the process of summing the modular powers of the decimal digits of the number ends with 1.