Generalized Fibonacci and Lucas Numbers.

  • Context: MHB 
  • Thread starter Thread starter meow91006
  • Start date Start date
  • Tags Tags
    generalized Numbers
Click For Summary
SUMMARY

The discussion revolves around proving a theorem related to Fibonacci and Lucas numbers, specifically the congruences U2mn+r ≡ (-1)mn Ur (mod Um) and V2mn+r ≡ (-1)mn Vr (mod Um). The theorem involves integers m, r, and a non-zero integer n. The original poster expresses difficulty in proving this theorem and seeks assistance to enhance their understanding of Fibonacci and Lucas numbers.

PREREQUISITES
  • Understanding of Fibonacci numbers and Lucas numbers
  • Familiarity with modular arithmetic
  • Basic knowledge of mathematical proofs
  • Experience with integer sequences
NEXT STEPS
  • Study the properties of Fibonacci and Lucas numbers
  • Learn about modular arithmetic and its applications in number theory
  • Explore techniques for proving mathematical theorems
  • Investigate congruences in integer sequences
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in the properties and proofs related to Fibonacci and Lucas numbers.

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
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
10K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K