Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-15T01:05:36.321Z Has data issue: false hasContentIssue false

Consecutive Integers with Close Kernels

Published online by Cambridge University Press:  24 October 2018

Jean-Marie De Koninck
Affiliation:
Département de mathématiques et de statistique, Université Laval, Québec G1V 0A6, Canada Email: jmdk@mat.ulaval.ca
Florian Luca
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South AfricaDepartment of Mathematics, Faculty of Sciences, University of Ostrava, 30 Dubna 22, 701 03 Ostrava 1, Czech Republic Email: florian.luca@wits.ac.za
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $k$ be an arbitrary positive integer and let $\unicode[STIX]{x1D6FE}(n)$ stand for the product of the distinct prime factors of $n$. For each integer $n\geqslant 2$, let $a_{n}$ and $b_{n}$ stand respectively for the maximum and the minimum of the $k$ integers $\unicode[STIX]{x1D6FE}(n+1),\unicode[STIX]{x1D6FE}(n+2),\ldots ,\unicode[STIX]{x1D6FE}(n+k)$. We show that $\liminf _{n\rightarrow \infty }a_{n}/b_{n}=1$. We also prove that the same result holds in the case of the Euler function and the sum of the divisors function, as well as the functions $\unicode[STIX]{x1D714}(n)$ and $\unicode[STIX]{x1D6FA}(n)$, which stand respectively for the number of distinct prime factors of $n$ and the total number of prime factors of $n$ counting their multiplicity.

Information

Type
Article
Copyright
© Canadian Mathematical Society 2018