Another simple construction of Smith numbers
From MaRDI portal
Let \(S(n)\) be the sum of digits of the natural number \(n\), \(S_p(n)\) the sum of the sum of digits of the prime factors of \(n\), counting multiplicity. A composite number \(n\) is called a Smith number if \(S(n)=S_p(n)\). The author proves that for any prime \(P>5\) with \(S(P)=5\), the numbers \(21P\) and \(112P\) are Smith numbers.
Recommendations
Cited in
(13)- For b 3 there exist infinitely many base b k-Smith numbers
- Smith numbers from primes with small digits
- Super Smith-Niven numbers
- scientific article; zbMATH DE number 4132252 (Why is no real title available?)
- scientific article; zbMATH DE number 3983259 (Why is no real title available?)
- Special Sets of Smith Numbers
- scientific article; zbMATH DE number 4002169 (Why is no real title available?)
- scientific article; zbMATH DE number 4075165 (Why is no real title available?)
- scientific article; zbMATH DE number 21765 (Why is no real title available?)
- Smith Numbers
- scientific article; zbMATH DE number 1845556 (Why is no real title available?)
- scientific article; zbMATH DE number 892619 (Why is no real title available?)
- A family of sequences generating Smith numbers
This page was built for publication: Another simple construction of Smith numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710353)