Counting primes whose sum of digits is prime

MaRDI QIDQ5404201zbMATH OpenFDO

Authors Glyn Harman

Publication date 24 March 2014

Full work available at URL http://www.emis.de/journals/JIS/VOL15/Harman/harman2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Mertens' theoremprime numbersum of digits

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Distribution of primes (11N05) Distribution functions associated with additive and positive multiplicative functions (11N60)

Recommendations

• Primes whose sum of digits is prime and metric number theory
• On the correlation of the sum of digits along prime numbers
• Primes with preassigned digits
• On a problem of Gelfond: the sum of digits of prime numbers
• Primes with an average sum of digits

Cited in

(2)

• The sum of digits of primes in \(\mathbb Z[i]\)
• Primes whose sum of digits is prime and metric number theory

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting primes whose sum of digits is prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404201)