Tuesday, June 12, 2018

number theory - Proving that 19mid52n+1+3n+2cdot2n1




How can I prove that 52n+1+3n+22n1

can be divided by 19 for any nonnegative n? What modulo should I choose?


Answer



You can prove this by induction.






First, show that this is true for n=1:



521+1+31+2211=198




Second, assume that this is true for n:



52n+1+3n+22n1=19k



Third, prove that this is true for n+1:



52(n+1)+1+3n+1+22n+11=



52+2n+1+31+n+221+n1=




5252n+1+313n+2212n1=



5252n+1+31213n+22n1=



2552n+1+63n+22n1=



2552n+1+(2519)3n+22n1=



2552n+1+253n+22n1193n+22n1=




25(52n+1+3n+22n1)193n+22n1=



2519k193n+22n1=



1925k193n+22n1=



19(25k3n+22n1)







Please note that the assumption is used only in the part marked red.


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