An algorithm for studying the digit sum of large integers (Q4954028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1448565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for studying the digit sum of large integers |
scientific article; zbMATH DE number 1448565 |
Statements
An algorithm for studying the digit sum of large integers (English)
0 references
21 May 2002
0 references
digits of integers
0 references
0.7459737062454224
0 references
0.7335358262062073
0 references
0.7183500528335571
0 references
0.7148454785346985
0 references
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.
0 references