On the Diophantine equation Fn1 + Fn2 + Fn3 = pz11 · · · pzss

Kwok Chi Chim, Volker Ziegler

Research output: Contribution to journalArticlepeer-review

5 Downloads (Pure)

Abstract

Let Fn denote the n-th Fibonacci number, and pi the i-th prime number. In this paper, we consider the Diophantine equation Fn1 + Fn2 + Fn3 = pz11 · · · pzss in non-negative integers n1 ≥ n2 ≥ n3 ≥ 0 and non-negative integers zi with 1 ≤ is. In particular, we completely solve the case that s = 12.
Original languageEnglish
Pages (from-to)407-434
Number of pages28
JournalPublicationes Mathematicae Debrecen
Volume103
Issue number3-4
Publication statusPublished - 2023

Keywords

  • diophantine equations
  • fibonacci sequences
  • linear forms in logarithms
  • recurrence sequences

Fingerprint

Dive into the research topics of 'On the Diophantine equation Fn1 + Fn2 + Fn3 = pz11 · · · pzss'. Together they form a unique fingerprint.

Cite this