On the number of restricted prime factors of an integer
From MaRDI portal
(Redirected from On the number of restricted prime factors of an integer)
Let \(q\geq 2\) and \(S(n)\) denote the sum of digits in base \(q\). Let \(\widetilde\omega(n)\) denote the number of distinct prime factors \(p\) of \(n\) such that \(S(p)\equiv a\mod b\). Similarly, let \(\widetilde \Omega(n)\) denote the number of prime factors \(p\) of \(n\) counted with multiplicities with \(S(p)\equiv a\mod b\). The authors estimate the summatory functions of \(\widetilde\omega\) and \(\widetilde\Omega\).
Recommendations
- On the normal number of prime factors of (n) subject to certain congruence conditions
- On the number of prime factors of integers characterized by digit properties
- Is the sequence of the sum of digits of prime numbers bounded?
- On a problem of Gelfond: the sum of digits of prime numbers
- On the order of magnitude of some arithmetical functions under digital constraint. I
Cites work
Cited in
(8)- Natürliche Zahlen mit primer Quersumme. (Integers with prime sum of digits)
- Difference of the digital sums of an integer base b and its prime factors
- On the number of distinct exponents in the prime factorization of an integer
- scientific article; zbMATH DE number 1995727 (Why is no real title available?)
- On the number of prime factors of integers characterized by digit properties
- On the friable mean value of additive arithmetic functions
- On the normal number of prime factors of (n) subject to certain congruence conditions
- On the order of magnitude of some arithmetical functions under digital constraint. I
This page was built for publication: On the number of restricted prime factors of an integer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397003)
