Multiples of repunits as sum of powers of ten
The sequence Pk,n = 1 + 10k + 102k + ⋯ + 10(n−1)k can be used to generate infinitely many Smith numbers with the help of a set of suitable multipliers. We prove the existence of such a set, consisting of constant multiples of repunits, that generalizes to any value of k ⩾ 9. This fact complements th...
Main Author: | Amin Witno |
---|---|
Format: | Article |
Language: | English |
Published: |
Emerald Publishing
2014-07-01
|
Series: | Arab Journal of Mathematical Sciences |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1319516613000339 |
Similar Items
-
The career of William Henry Smith, politician-journalist
by: Gray, Edgar Laughlin
Published: (1951) -
A case for the Enlightenment, ten essays
Published: (2017) -
Counting the sum of cubes for Lucas and Gibonacci numbers
by: Wamiliana, et al.
Published: (2019-04-01) -
Joseph Smith's View of His Own Calling
by: Boyle, Tucker John
Published: (2007) -
On sums of sets of integers /
by: Lin, Chio-Shih
Published: (1955)