Math Is Fun Forum
Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °
You are not logged in.
- Topics: Active | Unanswered
Pages: 1
#1 2016-04-23 02:07:21
GCD of Fibonacci Numbers
Show that gcd(fib(i),fib(j)) = fib(gcd(i,j))
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
#2 2016-04-23 04:03:35
- Nehushtan
- Member
- Registered: 2013-03-09
- Posts: 957
Re: GCD of Fibonacci Numbers
I would suggest proving that
[list=*]
[*]
[/list]
divides
[list=*]
[*]
[/list]
for all integers m and n. Which means showing that
[list=*]
[*]
[/list]
Last edited by Nehushtan (2016-04-23 04:18:03)
240 books currently added on Goodreads
Offline
Pages: 1