Prove that:
6n−5n+4 is divisible by 5 for n≥1
Using Modular arithmetic. Please do not refer to other SE questions, there was one already posted but it was using induction, I want to use this number theory method.
Obviously we have to take (mod5)
So:
6n−5n+4≡x(mod5)
All we need to do prove is prove x=0
How do we do that? I just need a hint, I am not sure how to solve congruences. Some ideas will be helpful.
Thanks!
Answer
Hint:-
6≡1(mod5)⟹6n≡1(mod5)
−5(n−1)≡0(mod5)
Solution:-
(1)+(2) gives,6n−5n+4≡0(mod5)
No comments:
Post a Comment