Could someone take a look at the following proposition I'm trying to prove? Note: I'm required to use induction, strong induction, or proof by smallest counter example. My approach was to use regular induction.
My proof is not complete but could someone see what I have so far and tell me if I'm on the right track? This may be way off base since up until now I've only been working proof by induction problems that start with something along the lines of "For every integer n..." or "If n∈N..." etc.
Proposition Suppose a∈Z. Prove that 5∣2na implies 5∣a for any n∈N.
Proof. We will prove this using mathematical induction.
Base Case. Let n=1. Then 5∣2(1)a which simplifies to 5∣2a. This means 2a=5b where b∈Z. Since the LHS of our equation is even, we know b must be even as well. So b=2c for some c∈Z. Thus 2a=5(2c)=2(5c). Dividing this equation by 2 gives a=5c. Therfore 5∣a.
Inductive Step. Let the natural number n=k≥1. We need to show that if 5∣2ka implies 5∣a then 5∣2k+1a implies 5∣a. We will use direct proof.
This is far as I've gotten.
[ADDED]
So then the Inductive Step would unfold as:
Inductive Step. Let the natural number n=k≥1. We need to show that if 5∣2ka implies 5∣a then 5∣2k+1a implies 5∣a. We will use direct proof.
Let us assume the statement 5∣2ka implies 5∣a is true. Now suppose 5∣2k+1a. Observe that 2k+1a=2⋅2ka=2a′ where a′=2ka. Since we know 5∣2a′ then it must be the case that 5∣a′ since 2 is even. By our inductive hypothesis if 5∣a′ and a′=2ka then it follows that 5∣a.
But if 5∣2ka implies 5∣a, which in turn implies that 5∣2k+1a implies 5∣a, we know that if 5∣2na then 5∣a for a∈Z and any n∈N. ◻
Answer
What you did so far is very good. Now suppose that holds for k and suppose that 5∣2k+1a. Note that 2k+1a=2×2ka=2a′ where a′=2ka. You know that your proposition holds for 1 and k...
No comments:
Post a Comment