Is the sequence of the sum of digits of prime numbers bounded?
The author considers (and solves some of them) various problems regarding, \(s_q(p)=\) sum of digits of the prime number \(p\) written in base \(q\). Particularly, he proves a general result, which specially implies that the sequence \(s_q(p))\), when \(p\) runs through the primes, is not bounded above. The author is not aware that, this result is due to \textit{W. Sierpiński} [Rend. Circ. Mat. Palermo, II. Ser. 10, 229--232 (1961; Zbl 0107.26407)]. (For related, and many properties of the function \(s_q(n)\), see the reviewer's and \textit{B. Crstici's} monograph [Handbook of number theory. II: Dordrecht: Kluwer Academic Publishers. 637 p. (2004; Zbl 1079.11001)]).
- Natürliche Zahlen mit primer Quersumme. (Integers with prime sum of digits)
- scientific article; zbMATH DE number 3179551 (Why is no real title available?)
- On the number of restricted prime factors of an integer
- scientific article; zbMATH DE number 1102884 (Why is no real title available?)
- scientific article; zbMATH DE number 2214408 (Why is no real title available?)
This page was built for publication: Is the sequence of the sum of digits of prime numbers bounded?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428389)
