Monday, June 3, 2019

divisibility - Prove that 5mid8n3n for nge1





I have that 58n3n



The first thing I tried is vía Induction:



It is true for n=1, then I have to probe that it's true for n=n+1



58(8n3n)
58n+183n
53(8n+183n)
538n+183n+1




After this, I don't know how to continue. Then I saw an example about a property: (a+b)n=am+bn with m=a+2b or the number it represents.



58n3n
5(5+3)n3n)
55m+3n3n)
55m



So, da only if a=kd. From this I get that 55m.




My questions:



1) Is the exercise correct?



2) Could it have been resolved via method 1?



Thanks a lot.


Answer



For induction, you have




8n+13n+1=88n33n=3(8n3n)+58n



Note that the first term must be divisible by 5 because 8n3n is divisie by 5.


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