scientific article; zbMATH DE number 3609782
The authors prove several theorems concerning the divisors of an integer. Let \(\tau(n)\) be the number of divisors of \(n\), and let \(d_1,\dots,d_{\tau}\) be all divisors of \(n\), ordered so that \(1=d_1< d_< \dots< d_{\tau}=n\). Let \(f(n)=\text{card}\{i:(d_i,d_{i+1})=1\}\). Next, let \(\tau_k(n)\) be the number of divisors of \(n\) of the form \(d=t(t+1)\dots(t+k-1)\), and let \(t_k(n) = \min\{t\geq 1:\) \(n| t(t+1)\dots(t+k-1)\}\). The following results are proven: Theorem 1. For every \(\varepsilon> 0\) and \(x> x_0(\varepsilon)\) \[ \max f(m)> \exp((\log\log x)^{2-\varepsilon}). \] Theorem 2. for each \(k\geq 2\) and every fixed \(A< e^{1/k}\) we have \(\tau_k(n)> (\log n)^A\) infinitely often. Theorem 3. \[ \frac{1}{x}\sum_{n\leq x}t_2(n)\ll x\frac{\log\log\log x}{\log\log x} \] The last proven result involves the divisors of two integers. We say that two integers \(m\) and \(n\) interlock if every pair of divisors of \(n\) are separated by a divisor of \(m\), and conversely (except for 1 and the smallest prime factor ofmn). An integer \(n\) is said to be separable if there exists an integer \(m\) such that \(m\) and \(n\) interlock, and let \(A(x)\) be the number of separable \(n\leq x\). It is proven: Theorem 4. For every fixed \(c'> 0\) and sufficiently large \(x\) we have \[ A(x)> c'x/\log\log x. \]
- On some divisor problems
- scientific article; zbMATH DE number 939039
- Some distribution problems concerning the divisors of integers
- Some Unconventional Problems in Number Theory
- Some unconventional problems in number theory
- scientific article; zbMATH DE number 3619965
- scientific article; zbMATH DE number 4175058
- scientific article; zbMATH DE number 3221561
- scientific article; zbMATH DE number 3219076
- scientific article; zbMATH DE number 772743
- On arithmetic functions related to consecutive divisors
- Sur la structure de la suite des diviseurs d'un entier. (On the structure of the séquence of divisors of an integer)
- Contribution of jumping numbers by exceptional divisors. With an appendix by Karen E. Smith, Kevin Tucker.
- Study of the divisor graph. I
- On the number of divisors which are values of a polynomial
- scientific article; zbMATH DE number 3834080 (Why is no real title available?)
- Some new approaches to infinite divisibility
- An extension of a result of Erdős and Zaremba
- scientific article; zbMATH DE number 6605654 (Why is no real title available?)
- On a class of arithmetic functions related to the divisors of an integer
- Relations in the set of divisors of an integer n
- Une inégalité de Hilbert pour les diviseurs. (A Hilbert inequality for divisors)
- Two \(S\)-unit equations with many solutions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175645)