arXiv Analytics

Sign in

arXiv:0912.2508 [math.NT]AbstractReferencesReviewsResources

On the series of the reciprocals lcm's of sequences of positive integers: A curious interpretation

Bakir Farhi

Published 2009-12-13Version 1

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to + \infty} \frac{1}{N} \sum_{n = 1}^{N} \tau_n = \sum_{n = 0}^{\infty} \frac{1}{\lcm\{a \in \A | a \leq n\}} .$${quote} In the two particular cases when $\A$ is the set of all positive integers and when $\A$ is the set of the prime numbers, we give a more precise result for the average asymptotic behavior of ${(\tau_n)}_n$. Furthermore, we discuss the irrationality of the limit of $\tau_n$ (in the average sense) by applying a result of Erd\H{o}s.

Comments: 14 pages
Journal: Integers: Electronic Journal of Combinatorial Number Theory, 9 (2009), p. 555-567 (#A42)
Categories: math.NT
Subjects: 11B83, 40A05
Related articles: Most relevant | Search more
arXiv:1406.6851 [math.NT] (Published 2014-06-26)
On Primitive Covering Numbers
arXiv:1309.3673 [math.NT] (Published 2013-09-14, updated 2014-03-22)
Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite?
arXiv:1309.0479 [math.NT] (Published 2013-09-02)
On the Interval [n,2n]: Primes, Composites and Perfect Powers