SOLUTION: Show that every two successive terms of the Fibonacci sequence are relatively prime by induction

Question 495491: Show that every two successive terms of the Fibonacci sequence are relatively prime by induction
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
The base cases are true.

Assume that for some n>2 that

and

are relatively prime, and we want to show that

and

are also relatively prime. By definition,

.

For any prime p satisfying

(mod p), it is apparent that

(mod p), because the nth and (n-1)th terms have no common factor other than 1. Hence, their sum

(mod p) for all p|(F_n) so we are done.
RELATED QUESTIONS
the Fibonacci sequence consists of the pattern 1,1,2,3,5,8,13 List the first eight terms (answered by Alan3354)

Show that 165,342,985 and 13 are relatively... (answered by vleith)

Show that 83,154,367 and 4 are relatively... (answered by ikleyn)

1,1,2,3,5,8,... find the next five terms of the Fibonacci... (answered by stanbon,octogirl)

7 people meet and shake hands with one another, how many handshakes occurred? using... (answered by solver91311)

. Use 4 and 5 as the first two terms of a Fibonacci-type sequence. Find the next five (answered by stanbon)

IF p and q are two relatively prime positive integers such that p+q=10, p (answered by MistyHoneycutt)
Please Help!!! I can figure out a) but not b). Can you please explain this to me? Thanks... (answered by Earlsdon)
Two positive integers M and N are defined to be relatively prime if GCF(M, N) = 1.... (answered by consc198,math_iz_hard)