In this paper, we look at a diophantine equation of the form un = x y , where (un)n≥0 is a binary recurrent sequence of integers. We show that if the pair of integers (x, y) belongs to a fixed line of the Pascal triangle, then the above equation has only finitely many positive integer solutions (n, x, y).

Luca, F., Pappalardi, F. (2005). Members of binary recurrences on lines of the Pascal triangle. PUBLICATIONES MATHEMATICAE, 67, 103-113.

Members of binary recurrences on lines of the Pascal triangle

PAPPALARDI, FRANCESCO
2005-01-01

Abstract

In this paper, we look at a diophantine equation of the form un = x y , where (un)n≥0 is a binary recurrent sequence of integers. We show that if the pair of integers (x, y) belongs to a fixed line of the Pascal triangle, then the above equation has only finitely many positive integer solutions (n, x, y).
2005
Luca, F., Pappalardi, F. (2005). Members of binary recurrences on lines of the Pascal triangle. PUBLICATIONES MATHEMATICAE, 67, 103-113.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/138768
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact