Publication date
March 1988
DOI Publisher
Published by Elsevier Inc. ISSN
0022-314XAbstract
AbstractAn algorithm which yields a short Egyptian fraction expansion in which the denominators stay small is given
AbstractAn algorithm which yields a short Egyptian fraction expansion in which the denominators stay small is given
International audienceGiven two irreducible fractions f and g, with f < g, we characterize the fract...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
AbstractWe say that an algorithm which could yield a short unit fraction expansion in which the deno...
AbstractWe show that for large N every rational number aN ∈]0, 1[ has an egyptian fraction expansion...
AbstractLet D(a,N) = min{nk:aN = Σ1k1ni, n1 < n2 < … < nk, ni ϵ Z0}, where the minimum ranges over a...
AbstractA rational number pq is said to be written in Egyptian form if it is presented as a sum of r...
AbstractAn algorithm which yields a short Egyptian fraction expansion in which the denominators stay...
International audience; Let a a, n, be positive integers that are relatively prime. We say that a/n ...
Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception,...
AbstractLet D(a, N) = min{nk:aK = ∑1k 1n1, n1 < n2 < ⋯ < nk, n1 ∈ Z0}, where the minimum ranges over...
AbstractIn this paper we prove (in a rather more precise form) two conjectures of P. Erdös about the...
Any rational number can be written as the sum of distinct unit fractions. In this survey paper we re...
AbstractLet D(a, N) = min{nk: aN = Σ1k 1ni, n1 < n2 < … < nk, ni ∈ Z}, where minimum ranges over all...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
International audienceGiven two irreducible fractions f and g, with f < g, we characterize the fract...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
AbstractWe say that an algorithm which could yield a short unit fraction expansion in which the deno...
AbstractWe show that for large N every rational number aN ∈]0, 1[ has an egyptian fraction expansion...
AbstractLet D(a,N) = min{nk:aN = Σ1k1ni, n1 < n2 < … < nk, ni ϵ Z0}, where the minimum ranges over a...
AbstractA rational number pq is said to be written in Egyptian form if it is presented as a sum of r...
AbstractAn algorithm which yields a short Egyptian fraction expansion in which the denominators stay...
International audience; Let a a, n, be positive integers that are relatively prime. We say that a/n ...
Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception,...
AbstractLet D(a, N) = min{nk:aK = ∑1k 1n1, n1 < n2 < ⋯ < nk, n1 ∈ Z0}, where the minimum ranges over...
AbstractIn this paper we prove (in a rather more precise form) two conjectures of P. Erdös about the...
Any rational number can be written as the sum of distinct unit fractions. In this survey paper we re...
AbstractLet D(a, N) = min{nk: aN = Σ1k 1ni, n1 < n2 < … < nk, ni ∈ Z}, where minimum ranges over all...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
International audienceGiven two irreducible fractions f and g, with f < g, we characterize the fract...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
Add to ORKG