Scribd Logo
Upload

Welcome to Scribd!

  • 103 views

    About A Fibonacci Problem: Mircea Becheanu

    Uploaded by

    G
    This document discusses Fibonacci's problem of finding rational numbers x such that x^2 + x and x^2 - x are perfect squares. It presents a general method to find all solutions to this problem. The method involves expressing the solutions in terms of integers m and n, where m and n are relatively prime integers of distinct parities. This leads to a solution for x, y, and z in terms of m and n. For example, the famous solution x = 25/24 is obtained by setting m = 2 and n = 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    About A Fibonacci Problem: Mircea Becheanu

    Uploaded by

    G
    103 views2 pages
    This document discusses Fibonacci's problem of finding rational numbers x such that x^2 + x and x^2 - x are perfect squares. It presents a general method to find all solutions to this problem. The method involves expressing the solutions in terms of integers m and n, where m and n are relatively prime integers of distinct parities. This leads to a solution for x, y, and z in terms of m and n. For example, the famous solution x = 25/24 is obtained by setting m = 2 and n = 1.

    Original Description:

    Fibonacci Problem

    Original Title

    Article 1 Fibonacci Problem

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses Fibonacci's problem of finding rational numbers x such that x^2 + x and x^2 - x are perfect squares. It presents a general method to find all solutions to this problem. The method involves expressing the solutions in terms of integers m and n, where m and n are relatively prime integers of distinct parities. This leads to a solution for x, y, and z in terms of m and n. For example, the famous solution x = 25/24 is obtained by setting m = 2 and n = 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    103 views2 pages

    About A Fibonacci Problem: Mircea Becheanu

    Uploaded by

    G
    This document discusses Fibonacci's problem of finding rational numbers x such that x^2 + x and x^2 - x are perfect squares. It presents a general method to find all solutions to this problem. The method involves expressing the solutions in terms of integers m and n, where m and n are relatively prime integers of distinct parities. This leads to a solution for x, y, and z in terms of m and n. For example, the famous solution x = 25/24 is obtained by setting m = 2 and n = 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    About a Fibonacci Problem

    Mircea Becheanu

    In the history of mathematics it is known that one of the first arithmetic problem which made Fibonacci
    famous was the following: find a (rational) number x such that x2 + x and x2 x are simultaneously perfect
    squares (in Q). He presented the solution x = 25
    24 , for which

    52 352
    x2 x = 2
    and x2 + x = 2 .
    24 24
    We do not know how he proceeded to find this solution. Also, there is no information if Fibonacci knew
    other solutions. We present a general method to find all numbers which are solutions of this problem.
    Expressed algebraically, this Fibonacci problem asks to find all rational solutions of the system:

    x2 x = y 2
    (1)
    x2 + x = z 2

    The system (1) is clearly equivalent to the following:

    2x2 = y 2 + z 2
    (2)
    x2 x = y 2

    Since (1) and (2) are equivalent, we may work with them simultaneously. It is clear that we can restrict the
    problem to find only positive solutions x, y, z > 0. Assume that
    a b c
    x= ;y = ;z = ,
    d d d
    where a, b, c, d are positive integers. From (2), we obtain the system

    2a2 = b2 + c2
    (3)
    a2 ad = b2 ,

    and also we may consider the additional equation

    a2 + ad = c2 (4)

    First, we prove that we may assume that gcd(a, d) = 1. Indeed, if gcd(a, d) = , > 1, we arrive at 2 |b2
    and 2 |c2 . Then, |b and |c, and the fractions y = db ; dc can be simplified. Now, from gcd(a, d) = 1, we have
    gcd(a, a d) = 1. From the equation a2 ad = b2 , we obtain that a and a d are perfect squares. Denote

    a = A2
    (5)
    a d = B2,

    where gcd(A, B) = 1 and b = AB. Again, from gcd(a, d) = 1 we have that gcd(a, a + d) = 1 and using the
    same argument, but for the equation (4), one obtains that

    a + d = C2
    (6)
    c = AC,

    where gcd(A, C) = 1. From these equations, we obtain that A, B, C satisfy the Diophantine equation

    B 2 + C 2 = 2A2 (7)

    1
    Lemma. The general integer solution of the equation
    u2 + v 2 = 2t2 ,
    with gcd(u, t)=gcd(v, t) = 1, is given by relations
    u = m2 + 2mn + n2 ; v = m2 + 2mn n2 ; t = m2 + n2 ,
    where m, n are integers of distinct parities and pairwise prime.
    Proof. Divide the equation by t2 and denote ut = x, vt = y. Then, the problem reduces to finding the
    rational points (x, y) on the circle satisfying
    x2 + y 2 = 2.
    We proceed by a standard method. The point A(1, 1) lies on the circle. Taking the pencil of lines
    L : y + 1 = (x + 1)
    through the point A, we observe that every line L intersects the circle again at a rational point if and only
    if is rational. Reciprocally, if a line of the pencil intersects the circle at a rational point, then is rational.
    Then, by intersecting the circle with L , we get a second point of coordinates
    2 + 2 + 1 2 + 2 1
    x= 2
    , y= .
    +1 2 + 1
    m
    If we denote = n where m, n are relatively prime integers, we obtain

    m2 + 2mn + n2 m2 + 2mn n2
    x= , y = .
    m 2 + n2 m2 + n2
    This proves the lemma.
    Going back to our problem, the lemma implies that the equation (7) has the general solution

    A = m2 + n2
    B = m2 + 2mn + n2 (8)
    2 2
    C = m + 2mn n ,
    where m, n are relatively prime integers of distinct parities. Moreover, since C > B, we have m > n.
    Returning to the original problem we have
    a = A2 = (m2 + n2 )2
    d = A2 B 2 = 4mn(m2 n2 )
    (9)
    b = AB = (m2 + n2 )(m2 + 2mn + n2 )
    c = AC = (m2 + n2 )(m2 + 2mn n2 ).
    In conclusion, the general solution to Fibonacci problem is
    (m2 + n2 )2
    x= ,
    4mn(m2 n2 )
    (m2 + n2 )(m2 + 2mn + n2 )
    y= ,
    4mn(m2 n2 )
    (m2 + n2 )(m2 + 2mn n2 )
    z= .
    4mn(m2 n2 )
    For m = 2 and n = 1, we obtain
    25 5 35
    x=; y= ; z= ,
    24 24 24
    which is a Fibonacci solution. For example, for m = 3 and n = 2, we have
    169 91 221
    x= ; y= ; z= .
    120 120 120

    You might also like