In an earlier paper it was argued that two sequences, denoted by {Un} and {Wn}, constitute the sextic analogues of the well-known Lucas sequences {un} and {vn}. While a number of the properties of {Un} and {Wn} were presented, several arithmetic properties of these sequences were only mentioned in passing. In this paper we discuss the derived sequences {Dn} and {En}, where Dn = gcd(Wn − 6R n, U...

We show that the cryptosystems based on Lucas sequences and on elliptic curves over a ring are insecure when a linear relation is known between two plaintexts that are encrypted with a “small” public exponent. This attack is already known for the classical RSA system, but the proofs and the results here are different.

In the book Proofs that Really Count [1], the authors use combinatorial arguments to prove many identities involving Fibonacci numbers, Lucas numbers, and their generalizations. Among these, they derive 91 of the 118 identities mentioned in Vajda’s book [2], leaving 27 identities unaccounted. Eight of these identities, presented later in this paper, have such a similar appearance, the authors r...

The functional equation f(3x) = 4f(3x−3)+f(3x− 6) will be solved and its Hyers-Ulam stability will be also investigated in the class of functions f : R → X , where X is a real Banach space. Keywords—Functional equation, Lucas sequence of the first kind, Hyers-Ulam stability.

Let (un)n≥0 be the binary recurrent sequence of integers given by u0 = 0, u1 = 1 and un+2 = 2(un+1 + un). We show that the only positive perfect powers in this sequence are u1 = 1 and u4 = 16. We also discuss the problem of determining perfect powers in Lucas sequences in general.

In a series of papers, D. Gordon and C. Pomerance demonstrated that pseudoprimes on elliptic curves behave in many ways very similar to pseudoprimes related to Lucas sequences. In this paper we give an answer to a challenge that was posted by D. Gordon in 1989. The challenge was to either prove that a certain composite N ≡ 1 mod 4 did not exist, or to explicitly calculate such a number. In this...

In this paper we generalize the Pell numbers and the Pell-Lucas numbers and next we give their graph representations. We shall show that the generalized Pell numbers and the generalized Pell-Lucas numbers are equal to the total number of independent sets in special graphs.

We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci number Fn. We show that the number of bit operations in the conventional product of Lucas numbers algorithm can be reduced by replacing multiplication with the square operation.  2000 Elsevier Science B.V. All rights ...

It is well known that balancing and Lucas-balancing numbers are expressed as determinants of suitable tridiagonal matrices. The aim of this paper is to express certain subsequences of balancing and Lucas-balancing numbers in terms of determinants of tridiagonal matrices. Using these tridiagonal matrices, a factorization of the balancing numbers is also derived.

This note is dedicated to Professor Gould. The aim is to show how the identities in his book ”Combinatorial Identities” can be used to obtain identities for Fibonacci and Lucas polynomials. In turn these identities allow to derive a wealth of numerical identities for Fibonacci and Lucas numbers.