On the counting function of semiprimes
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument, asymptotic series of $\pi_2(x)$ is determined, with all the terms ex...
Main Authors: | Crişan, D, Erban, R |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Colgate University, Charles University and DIMATIA
2021
|
Similar Items
-
On Fully Semiprime Submodules and Fully Semiprime Modules
by: I.M.A. Hadi, et al.
Published: (2017-05-01) -
Quasi-semiprime Modules
by: Muntaha Abdul- Razaq Hasan
Published: (2023-10-01) -
Semiprime Fuzzy Modules
by: M. A. Hamil
Published: (2017-05-01) -
Semiprime rings with generalized homoderivations
by: Abdelkarim Boua, et al.
Published: (2022-12-01) -
Graded semiprime multiplication modules
by: Rashid Abu-Dawwas
Published: (2020-10-01)