Monday, June 17, 2019

calculus - prove that for every natural n, 5n2n, can be divided by 3


How to prove, using recursion, that for every natural n:5n2n can be divided by 3.


Answer



  1. setting n=1, 5121=3 is divisible by 3

Thus, the number 5n2n is divisible by 3 for n=1



  1. assume for n=k, the number 5n2n is divisible by 3 then 5k2k=3m where, m is some integer




  2. setting n=k+1, 5k+12k+1=55k22k =55k52k+32k =5(5k2k)+32k =5(3m)+32k =3(5m+2k) since, (5m+2k) is an integer hence, the above number 3(5m+2k) is divisible by 3




Hence, 5n2n is divisible by 3 for all integers n1


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...