The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: gcd Fibonacci Lucas
Replies: 1   Last Post: Dec 14, 2012 4:52 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 137
Registered: 3/4/09
gcd Fibonacci Lucas
Posted: Dec 12, 2012 2:54 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Let a, b the zeos of x^2-x-1

and for n>=0

F_0=0 F_1=1


L_0=2 L_1=1

the following result (and his proof) is well known

gcd(F_n, F_p)=F_gcd(n,p)
(first, one can use F_(n+p)=F_(n+1)F_p+F_nF_(n-1)
to show gcd(F_n,F_p)=gcd(F_n,F_(n+p))

but if this other result is known


=L_d if n/d and p/d are odd

= 2 if n/d or p/d is even and 3|d

=1 if n/d or p/d is even and 3 do not divide d

(with d= gcd(n,p) )

but I don't find a proof ...

one can read :
Using basic identities Lucas proved this
this result is more subtle than the first

Date Subject Author
Read gcd Fibonacci Lucas
Read Re: gcd Fibonacci Lucas

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.