Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2406.04574 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- Given an integer $k\ge2$, let $ω_k(n)$ denote the number of primes that divide $n$ with multiplicity exactly $k$. We compute the density $e_{k,m}$ of those integers $n$ for which $ω_k(n)=m$ for every integer $m\ge0$. We also show that the generating function $\sum_{m=0}^\infty e_{k,m}z^m$ is an entire function that can be written in the form $\prod_{p} \bigl(1+{(p-1)(z-1)}/{p^{k+1}} \bigr)$; from this representation we show how to both numerically calculate the $e_{k,m}$ to high precision and provide an asymptotic upper bound for the $e_{k,m}$. We further show how to generalize these results to all additive functions of the form $\sum_{j=2}^\infty a_j ω_j(n)$; when $a_j=j-1$ this recovers a classical result of Rényi on the distribution of $Ω(n)-ω(n)$.