Powers in Recurrence Sequences: Pell Equations
نویسنده
چکیده
In this paper, we present a new technique for determining all perfect powers in so-called Pell sequences. To be precise, given a positive nonsquare integer D, we show how to (practically) solve Diophantine equations of the form x −Dy = 1 in integers x, y and n ≥ 2. Our method relies upon Frey curves and corresponding Galois representations and eschews lower bounds for linear forms in logarithms. Along the way, we sharpen and generalize work of Cao, Af Ekenstam, Ljunggren and Tartakowsky on these and related questions.
منابع مشابه
A formula for the generating functions of powers of Horadam's sequence
The second-order linear recurrence sequence (wn(a, b; p, q))n≥0, or briefly (wn)n≥0, is defined by wn+2 = pwn+1 + qwn, (1) with w0 = a, w1 = b and n ≥ 0. This sequence was introduced in 1965 by Horadam [3, 4], and it generalizes many sequences (see [1, 5]). Examples of such sequences are Fibonacci number sequences (Fn)n≥0, Lucas number sequences (Ln)n≥0, and Pell number sequences (Pn)n≥0, when ...
متن کاملSquaring the terms of an ℓth order linear recurrence
is (an(c0, . . . , cl−1; p1, . . . , pl))n≥0, or briefly (an)n≥0, where the pi are constant coefficients, with given aj = cj for all j = 0, 1, . . . , l − 1, and n ≥ l; in such a context, (an)n≥0 is called an l-sequence. In the case l = 2, this sequence is called Horadam’s sequence and was introduced, in 1965, by Horadam [4, 5], and it generalizes many sequences (see [1, 6]). Examples of such s...
متن کاملOn the Resolution of the Equations
The purpose of the present paper is to prove that there are finitely many binomial coefficients of the form (f in certain binary recurrences, and give a simple method for the determination of these coefficients. We illustrate the method by the Fibonacci, the Lucas, and the Pell sequences. First, we transform both of the title equations into two elliptic equations and apply a theorem of Mordell ...
متن کاملOn The Generalized Fibonacci And Pell Sequences By Hessenberg Matrices
In this paper, we consider the generalized Fibonacci and Pell Sequences and then show the relationships between the generalized Fibonacci and Pell sequences, and the Hessenberg permanents and determinants. 1. Introduction The Fibonacci sequence, fFng ; is de ned by the recurrence relation, for n 1 Fn+1 = Fn + Fn 1 (1.1) where F0 = 0; F1 = 1: The Pell Sequence, fPng ; is de ned by the recurrence...
متن کاملThe K-periodic Fibonacci Sequence and an Extended Binet’s Formula
It is well-known that a continued fraction is periodic if and only if it is the representation of a quadratic irrational α. In this paper, we consider the family of sequences obtained from the recurrence relation generated by the numerators of the convergents of these numbers α. These sequences are generalizations of most of the Fibonacci-like sequences, such as the Fibonacci sequence itself, r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004