Products of Prime Powers in Binary Recurrence Sequences
نویسندگان
چکیده
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation G, = wp" ... p', (where (G,, }I='o is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation x2 + k = ... ps', which is a generalization of the Ramanujan-Nagell equation x2 + 7 = 2Z. We present algorithms to reduce upper bounds for the solutions of these equations. The algorithms are easy to translate into computer programs. We present an example which shows that in practice the method works well.
منابع مشابه
Small Prime Powers in the Fibonacci Sequence
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenthor seventeenth powers in the Fibonacci sequence. For eleventh, thirteenthand seventeenth powers an alternative (to the usual exhaustive check of products of powers of fundamental units) method is used to overcome the problem of having a large number of independent units and relatively high bounds on their exponents...
متن کاملProducts of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation C„ = wpTM< ■ ■ ■ p"< (where {G„}^_o is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation x2 + k = p\' ■ ■ ■ pf', which is a generalization of the Ramanujan-Nagell equation x2 + 7 = ...
متن کاملComposed products and factors of cyclotomic polynomials over finite fields
Let q = ps be a power of a prime number p and let Fq be a finite field with q elements. This paper aims to demonstrate the utility and relation of composed products to other areas such as the factorization of cyclotomic polynomials, construction of irreducible polynomials, and linear recurrence sequences over Fq . In particular we obtain the explicit factorization of the cyclotomic polynomial Φ...
متن کاملGeneralized Fibonacci Sequences modulo Powers of a Prime
Let us begin by defining a generalized Fibonacci sequence (gn) with all gn in some abelian group as a sequence that satisfies the recurrence gn = gn−1 + gn−2 as n ranges over Z. The Fibonacci sequence (Fn) is the generalized Fibonacci sequence with integer values defined by F0 = 0 and F1 = 1. Recall also the Binet formula: for any integer n, Fn = (α − β)/ √ 5, where α = (1 + √ 5)/2 and β = (1− ...
متن کاملGeneral Approach in Computing Sums of Products of Binary Sequences
In this paper we find a general approach to find closed forms of sums of products of arbitrary sequences satisfying the same recurrence with different initial conditions. We apply successfully our technique to sums of products of such sequences with indices in (arbitrary) arithmetic progressions. It generalizes many results from literature. We propose also an extension where the sequences satis...
متن کامل