Generalized Fibonacci and Lucas Numbers.

  • Topic:
  • Thread starter Thread starter meow91006
  • Start date Start date
  • Tags Tags
    generalized Numbers
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
1 reply · 2K views · last reply
meow91006
Messages
1
Reaction score
0
[h=2][/h]
Can you help me prove this theorem regarding Fibonacci and Lucas numbers?

Theorem.

Let m,r ϵ Z and n be non-zero integer. Then

U2mn
+r ≡ (-1)mn Ur (mod Um) and

V2mn
+r ≡ (-1)mn Vr (mod Um).Im not that good at proving. This type of congruence is much harder than what I read in our book, but I badly need the proof for this one, even just this one, to understand better Fiboancci and Lucas numbers.

I'd be glad to hear from you soon.
Thank you very much!
​

 
Mathematics news on Phys.org
meow91006 said:
Can you help me prove this theorem regarding Fibonacci and Lucas numbers?

Theorem.

Let m,r ϵ Z and n be non-zero integer. Then

U2mn
+r ≡ (-1)mn Ur (mod Um) and

V2mn
+r ≡ (-1)mn Vr (mod Um).Im not that good at proving. This type of congruence is much harder than what I read in our book, but I badly need the proof for this one, even just this one, to understand better Fiboancci and Lucas numbers.

I'd be glad to hear from you soon.
Thank you very much!
​



That is not a question as it stands, please post the full question.

CB