scientific article; zbMATH DE number 1092062

MaRDI QIDQ4367329zbMATH OpenFDO

Authors Hongguan Yu, Mingfeng He

Publication date 17 December 1997

zbMATH Keywords

approximation by unit fractionsKulkarni's question

Mathematics Subject Classification ID

Continued fractions (11A55) Continued fractions and generalizations (11J70) Calculation of integer sequences (11Y55)

Review text

For a given positive real number \(A\) and a natural number \(n\) there exist infinitely many natural numbers \(m_1,m_2,\dots, m_n\) such that \[ D=A- \sum_{i=1}^n \frac{1}{m_i}>0. \] Then Kulkarni's question is the following: Is there a smallest such \(D\) and, if there is, how to find \(m_1,m_2,\dots, m_n\)? This paper only deals with the case where \(A\) is a unit fraction.

Recommendations

• scientific article; zbMATH DE number 3943911
• On unit fractions with denominators in short intervals
• Length and denominators of Egyptian fractions
• Length and denominators of Egyptian fractions. II

Cited in

(7)

• A derivation of Kohnert's algorithm from Monk's rule
• On unit fractions with denominators in short intervals
• A simple solution to the k‐core problem
• scientific article; zbMATH DE number 3943911 (Why is no real title available?)
• scientific article; zbMATH DE number 18886 (Why is no real title available?)
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
• An in-place algorithm for Klee's measure problem in two dimensions

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 Q4367329)