Sunday, March 31, 2019

number theory - How to prove that 4n3n1 is divisible by 9?



How can I prove that 4n3n1 is divisible by 9? I tried dividing the expression by 9 and seeing if the terms cancelled in any predictable way but I still cannot prove it. Maybe there is a clever solution but so far I have been unable to spot it.


Answer



Call an=4n3n1. Then an+1=4n+13n4=4(4n3n1)+9n so two consecutive terms differ by a multiple of 9. Since a0=0 is divisible by 9, all of them are.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...