On the quantity of numbers of special form depending on the parity of the number of their different prime divisors (Q745639): Difference between revisions
From MaRDI portal
Latest revision as of 09:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the quantity of numbers of special form depending on the parity of the number of their different prime divisors |
scientific article |
Statements
On the quantity of numbers of special form depending on the parity of the number of their different prime divisors (English)
0 references
14 October 2015
0 references
Let \(M\) be the set of positive integers such that all prime divisors belong to an infinite set of prime numbers. Assume that \(E\) and \(O\) are two subsets of \(M\) consisting of numbers with an even and odd number of these prime divisors, respectively. The author then obtains an asymptotic formula for the difference of the counting functions of \(E\) and \(O\).
0 references
natural number
0 references
prime divisor
0 references
Euler's identity
0 references
Dirichlet generating series
0 references
Perron's formula
0 references
Cauchy's integral theorem
0 references
