For \(b\geq 3\) there exist infinitely many base \(b\) \(k\)-Smith numbers (Q1567160)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: For \(b\geq 3\) there exist infinitely many base \(b\) \(k\)-Smith numbers |
scientific article; zbMATH DE number 1455484
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | For \(b\geq 3\) there exist infinitely many base \(b\) \(k\)-Smith numbers |
scientific article; zbMATH DE number 1455484 |
Statements
For \(b\geq 3\) there exist infinitely many base \(b\) \(k\)-Smith numbers (English)
0 references
24 August 2000
0 references
For a base \(b\geq 3\) let \(S(x)\) denote the sum of the base \(b\) digits of \(x\) and let \(S_p(x)=\sum_{i=1}^r a_i S(p_i)\), where \(x=\prod_{i=1}^r p_i^{a_i}\) is the canonical form of \(x\). The number \(x\) is called a base \(b\) \(k\)-Smith number if \(x\) is composite and \(S_p(x)=kS(x)\). It was shown by \textit{W. L. McDaniel} [J. Number Theory 31, 91-98 (1989; Zbl 0673.10002)] that for \(b\geq 8\) there exist infinitely many \(b\) \(k\)-Smith numbers. Modifying the arguments of that paper, it is shown in the paper under review that this is true for any base \(b\geq 3\).
0 references
base \(b\) digits
0 references
sum of the base \(b\) digits
0 references
Smith numbers
0 references
0.7520873
0 references
0.7429561
0 references
0.73724484
0 references
0.73201144
0 references
0.72739065
0 references
0 references