Explicit bound of the divisor function (Q829350)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Explicit bound of the divisor function |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit bound of the divisor function |
scientific article |
Statements
Explicit bound of the divisor function (English)
0 references
5 May 2021
0 references
The author proves that the sum of values of Piltz divisor function up to \(x\) satisfies the upper bound \((x(\log x + C_k)^{k-1})/(k-1)!\) for \(1\le x<3\) and \(k\ge 3\) or \(x\ge 3\) and \(k\ge 2\) , where \(C_k\) is approximately \(0.807k -1\). This improves the famous old upper bound by \textit{K. Mardzhanishvili} [C. R. (Dokl.) Acad. Sci. URSS, n. Ser. 22, 387--389 (1939; Zbl 0021.20802)], where in place of \(C_k\) appears \(k-1\). The interesting elementary method is based on mathematical induction. As application, one can obtain improved explicit upper bounds for the class number of number fields.
0 references
divisor function
0 references
explicit bound
0 references
Piltz divisor function
0 references
