Thursday, 5 December 2013

elementary number theory - Proof of divisibility using modular arithmetic: 5mid6n5n+4



Prove that:




6n5n+4 is divisible by 5 for n1



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:



6n5n+4x(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:-
61(mod5)6n1(mod5)




5(n1)0(mod5)



Solution:-




(1)+(2) gives,6n5n+40(mod5)



No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...