Common divisors of the Euler function at related arguments

William D. Banks, Florian Luca, Igor E. Shparlinski

Research output: Contribution to journalArticle

Abstract

Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which the largest prime factor of φ(n) also divides φ(n + k). We obtain an unconditional upper bound on the number of such integers n ≤ x, as well as unconditional lower bounds in each of the cases k > 0 and k <0. We also obtain some conditional lower bounds, for example, under the Prime K-tuplets Conjecture. Our lower bounds are based on explicit constructions.
Original languageEnglish
Pages (from-to)525-536
Number of pages12
JournalActa Scientiarum Mathematicarum
Volume72
Issue number3-4
Publication statusPublished - 2006

    Fingerprint

Keywords

  • Euler function
  • largest prime factor
  • shift

Cite this