Average order of the cardinality of some sets of prime factors (Q1335539): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q216316 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Juergen Spilker / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arithmetical functions associated with the unitary divisors of an integer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of \(k\)-ary divisors of an integer / rank | |||
Normal rank | |||
Latest revision as of 18:11, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average order of the cardinality of some sets of prime factors |
scientific article |
Statements
Average order of the cardinality of some sets of prime factors (English)
0 references
9 October 1994
0 references
Die bekannte asymptotische Entwicklung der Primteilerfunktion \[ \sum_{n\leq x} \omega(n)= x\log\log x+Ax+ O\biggl( {x\over {\log x}}\biggr) \] wird auf andere additive Funktionen \(f\) ausgedehnt, z.B. auf \(f(p^ \alpha)= \begin{cases} 1,\;&\alpha\geq k\\ 0, &\alpha< k\end{cases}\), also die Anzahlfunktion der \(k\)-vollen Teiler. Analoges wird für \(k\)-freie, \(k\)-vollständige, \(k\)-unitäre und ähnliche Teiler bewiesen. Die Beweise sind elementar und Varianten der bekannten.
0 references
arithmetical functions
0 references
asymptotic results on primes
0 references
number of \(k\)-full divisors
0 references
\(k\)-free divisors
0 references
\(k\)-complete divisors
0 references
\(k\)-unitary divisors
0 references
