✦ LIBER ✦

On the sum of digits of primes

✍ Scribed by I. Kátai

Publisher: Akadmiai Kiad
Year: 1977
Tongue: English
Weight: 169 KB
Volume: 30
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01895662

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The sum of digits of primes in({mathbb{Z

The sum of digits of primes in({mathbb{Z}})[i]

✍ Michael Drmota; Joël Rivat; Thomas Stoll 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 379 KB

Searching for primes in the digits of π

✍ D. Byatt; M.L. Dalrymple; R.M. Turner 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Distribution of digits of primes inq-ary

Distribution of digits of primes inq-ary canonical form

✍ I. Kátai 📂 Article 📅 1986 🏛 Akadmiai Kiad 🌐 English ⚖ 668 KB

The parity of the Zeckendorf sum-of-digi

The parity of the Zeckendorf sum-of-digits function

✍ Michael Drmota; Mariusz Skałba 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 170 KB

Some remarks concerning the sum of digit

Some remarks concerning the sum of digits of integers

✍ L. Dringó; I. Kátai 📂 Article 📅 1981 🏛 Akadmiai Kiad 🌐 English ⚖ 303 KB

On the Arithmetic Structure of Sets Char

On the Arithmetic Structure of Sets Characterized by Sum of Digits Properties

✍ Christian Mauduit; Andràs Sárközy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Throughout this paper, we use the following notations: we denote by Z (resp. N) the set of integers (resp. positive integers) and we write l 1 =log N, l 2 =log log N, l 3 =log log log N and e(:)=e 2i?: . If f(n)=O(g(n)), then we write f (n)< <g(n). We denote by |(n) the number of distinct prime fact