### Abstract

LetM(n) be the largest integer that can be expressed as a sum of the reciprocal of distinct integers ≤n. Then for somec_{1},c_{2}>0, log n+γ-2-(c_{1}/log_{2} n)≤M(n)≤logn+γ-(c_{2}/log_{2} n), which answers a question of Erdos.

Original language | English |
---|---|

Pages (from-to) | 206-216 |

Number of pages | 11 |

Journal | Journal of Number Theory |

Volume | 76 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1999 Jun 1 |

### ASJC Scopus subject areas

- Algebra and Number Theory

## Fingerprint Dive into the research topics of 'The Largest Integer Expressible as a Sum of Reciprocal of Integers'. Together they form a unique fingerprint.

## Cite this

Yokota, H. (1999). The Largest Integer Expressible as a Sum of Reciprocal of Integers.

*Journal of Number Theory*,*76*(2), 206-216. https://doi.org/10.1006/jnth.1998.2359