most citedNontrivial lower bounds for the least common multiple of some finite sequences of integers

8 citations · 10 across the 5 of their papers we have counts for

collaborators

6 papers

math.NT20081 cited

New results on the least common multiple of consecutive integers

Bakir Farhi, Daniel Kane

When studying the least common multiple of some finite sequences of integers, the first author introduced the interesting arithmetic functions , defined b…

math.NT2008

A simple proof that any additive basis has only finitely many essential subsets

Bakir Farhi

Let be an additive basis. We call ``essential subset'' of any finite subset of such that is not an additive basis and that is minimal (for the i…

math.NT2008

A curious result related to Kempner's series

Bakir Farhi

It is well known since A. J. Kempner's work that the series of the reciprocals of the positive integers whose the decimal representation does not contain any digit 9, is convergent…

math.NT20088 cited

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

Bakir Farhi

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (whic…

math.NT20081 cited

Essentialité dans les bases additives

Bruno Deschamps, Bakir Farhi

In this article we study the notion of essential subset of an additive basis, that is to say the minimal finite subsets of a basis such that doesn't remains…

math.NT2006

Formulas giving prime numbers under Cramér's conjecture

Bakir Farhi

Under Cramér's conjecture concerning the prime numbers, we prove that for any , there exists a real for which the formula (where denotes the intege…