Wednesday, August 15, 2018

Prove by Induction: 8n3n is divisible by 5 for all ngeq1




Prove by Induction that for all n1 we have



8n3nis divisible by 5...()



My proof so far



Step 1: For n=1 we have 8131=83=5 which is divisible by 5.



Step 2: Suppose (*) is true for some n=k1 that is 8k3k is divisible by 5.




Step 3: Prove that (*) is true for n=k+1, that is 8k+13k+1 is divisible by 5. We have



8k+13k+1=88k33k



Can anyone explain the next logical expansion?



Update:



8k+13k+1=88k33k=58k+38k33k=58k+3(8k3k)




Now we can say that 58k is divisible by 5 since it has the form 5p where p is an integer 1



And it is assumed that 8k3k is divisible by 5, then 3(8k3k) is divisible by 5 which means it has the form 5p



so we reduce the expression to
5p+5p=5(p+p)



which is of the form 5p, which is divisible by 5.




Is my proof correct?


Answer



There is, more or less, somewhat of a "standard" way of writing out these divisibility proofs involving induction. Given your recent questions on induction, I really would encourage you to take a look at this post on how to write a clear induction proof--I think it would force you to construct clear proofs and it would also force you to know what you are doing and why at each step. That said, see if the following proof makes sense (I am going to write it using the template provided in the linked post above):







For all n1,8n3n is divisible by 5; that is, 5(8n3n), and this notation simply means that "5 divides 8n3n."





Proof. For n1, let S(n) denote the statement
S(n):5(8n3n)8n3n=5m,mZ.


Base case (n=1): S(1) says that 5(8131), and this is true (all it is saying is that 5 divides 5, and that is clearly true).



Inductive step: Fix some k1 and assume that
S(k):5(8k3k)8k3k=5,Z



is true. To be shown is that S(k+1) follows where
S(k+1):5(8k+13k+1)8k+13k+1=5η,ηZ.

Beginning with the left-hand side of S(k+1),
8k+13k+1=8(8k)3(3k)=(8k3k)8+5(3k)=(5)8+5(3k)=5(8+3k)=5η

we end up at the right-hand side of S(k+1), completing the inductive step.



By mathematical induction, the proposition S(n) is true for all n1.






Does all of that make sense? Near the end of your own proof, you write that 5(p+p) is of the form 5p which is not actually true. The key is to realize how to generalize as above where you can use any number of symbols so long as you do it effectively. Feel free to comment if a step remains unclear.


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