Differences of Harmonic Numbers and the abc-Conjecture

  • Natalia da Silva California State University, Dominguez Hills
  • Serban Raianu California State University, Dominguez Hills
  • Hector Salgado California State University, Dominguez Hills
Keywords: harmonic numbers; modular arithmetic; exponential Diophantine equation; Gersonides' Theorem; abc-conjecture; Dirichlet's Theorem

Abstract

Our main source of inspiration was a talk by Hendrik Lenstra on harmonic numbers, which are numbers whose only prime factors are two or three. Gersonides proved 675 years ago that one can be written as a difference of harmonic numbers in only four ways: 2-1, 3-2, 4-3, and 9-8. We investigate which numbers other than one can or cannot be written as a difference of harmonic numbers and we look at their connection to the abc-conjecture. We find that there are only eleven numbers less than 100 that cannot be written as a difference of harmonic numbers (we call these ndh-numbers). The smallest ndh-number is 41, which is also Euler's largest lucky number and is a very interesting number. We then show there are infinitely many ndh-numbers, some of which are the primes congruent to 41 modulo 48. For each Fermat or Mersenne prime we either prove that it is an ndh-number or find all ways it can be written as a difference of harmonic numbers. Finally, as suggested by Lenstra in his talk, we interpret Gersonides's theorem as "The abc-conjecture is true on the set of harmonic numbers" and we expand the set on which the abc-conjecture is true by adding to the set of harmonic numbers the following sets (one at a time): a finite set of ndh-numbers, the infinite set of primes of the form 48k+41, the set of Fermat primes, and the set of Mersenne primes.

Published
2018-01-05
How to Cite
da Silva, N., Raianu, S., & Salgado, H. (2018). Differences of Harmonic Numbers and the abc-Conjecture. The PUMP Journal of Undergraduate Research, 1, 1-13. https://doi.org/10.46787/pump.v1i0.147