On the number of restricted prime factors of an integer (Q397003)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6330496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of restricted prime factors of an integer |
scientific article; zbMATH DE number 6330496 |
Statements
On the number of restricted prime factors of an integer (English)
0 references
14 August 2014
0 references
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\).
0 references
sum-of-digits function
0 references
exponential sum
0 references
0.847590446472168
0 references
0.8237709999084473
0 references
0.8222622871398926
0 references
0.8047316074371338
0 references
0.8024258613586426
0 references