An algorithm for studying the digit sum of large integers
From MaRDI portal
The author is concerned with problems relating to digits of integers, in particular when the sum of the digits is a factor of their product. Proportions of such occurences are given and a conjecture made. To deal with integers larger than can be represented in the usual way the results for \(k\) digits are obtained from those with \(k-1\) digits. The work given uses base 10 and non-zero digits, but it is stated that it can be extended to any base, and with zero digits allowed.
Recommendations
Cited in
(3)
This page was built for publication: An algorithm for studying the digit sum of large integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954028)