109 Arhimede Mathematical Journal

Definition 1. Let {xn }n∈N be a P -sequence. We say that it is a

P J -sequence if it satisfies the following:

1. xn < xn+1 , for every n ∈ N,

2. (xn , xn+1 ) ∈ P , for every n ∈ N, and
3. (xn , xn+1 , xn+2 ) satisfies xn xn+2 = x2n+1 − 1, for every n ∈ N.

The following result proves the uniqueness of maximal P J -sequences,

where maximality is defined in the obvious way.

Proposition 1. Let (x, y, z) be a triplet of positive integers satisfy-

ing

A.1 x < y < z ,

A.2 (x, y), (y, z) ∈ P ,
A.3 xz = y 2 − 1.

There exists a unique maximal P J -sequence {xn }n∈N and m ∈ N

such that x = xm , y = xm+1 and z = xm+2 . This means that x, y
and z are consecutive terms in this P J -sequence. Furthermore
x0 = 1, x2 = x21 − 1, and so forth.

Proof. Let x, y, z be positive integers verifying the conditions of

Proposition 1. We define y0 = x, y1 = y , and y2 = z , and we set
2
u = x y−1 . As x < y we have that

x2 − 1 x2 − 1 1
u= < <x− < x.
y x x

On the other hand, since y 2 ≡ 1 (mod x), there exists h ∈ N such

that y 2 − 1 = xh. Hence we deduce that
!2
2
x2 − 1 x4 − 2x2 + 1 − y 2 x(x3 − 2x − h)
u −1= −1= = .
y y2 y2

Now, as x and y are coprime, then u2 − 1 ≡ 0 (mod x). In

consequence, the triplet (u, x, y) satisfies the same properties that
the initial triplet, and u < x. We define y−1 = u.

Following this process, we obtain the triplet (y−m , y−m+1 , y−m+2 ).

By doing this, there will exist m0 such that we are not able to