The propinquity of divisors (Q3778076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4037936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The propinquity of divisors |
scientific article; zbMATH DE number 4037936 |
Statements
The propinquity of divisors (English)
0 references
1987
0 references
functions involving divisors
0 references
propinquity
0 references
0.8165966868400574
0 references
0.8073562383651733
0 references
0.8073559999465942
0 references
0.8024501204490662
0 references
Various approaches have been used to study properties of the divisors of an arbitrary large positive integer, and in particular the question of quantifying the propinquity of two or more divisors. Some investigations have utilized the \(\Delta\)-function \[ \Delta (n)=\max_{u}\sum_{d| n;u<\log d\leq u+1}1 \] and its r-fold extension \(\Delta_ r(n)\), introduced by \textit{C. Hooley} in [Proc. Lond. Math. Soc., III. Ser. 38, 115-151 (1979; Zbl 0394.10027)]. Generalizing an earlier definition of his, the present author defines and studies another function of similar type: \[ T_ r(n,\alpha)=card\{d_ 1d_ 2... d_{r-1} | n,\quad d_ 1'd_ 2'.... d'_{r-1} | n\quad: | \log (d_ i/d_ i')| \leq (\log n)^{\alpha},\quad 1\leq i<r\} \] for \(0\leq \alpha <1\) and \(r\geq 2\). He derives bounds for \(T_ r(n,\alpha)\) and for the sums \(\sum_{n\leq x}T_ r(n,\alpha)y^{\omega (n)}\) for \(y>0\) and \(\sum_{n\leq x}\Delta_ r(n)^ 2y^{\omega(n)}\) for \(y>2/r\), \(r\geq 2\).
0 references