Using induction, I have to prove that n2+n is divisible by 2.
Here's how I did it, and I wanted to know if this is considered valid. I started with (k+1)2+(k+1), and after simplifying and factoring, I got (k+2)(k+1). From this, can't I just say that if k is odd, then the term (k+1) becomes an even number, and when an even number is multiplied by an odd number, you get an even number which is always divisible by 2. Then, the same logic can be applied for when k is even and added to the term (k+2)? Q.E.D...?
Thursday, July 4, 2019
Induction proof verification?
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection f:A→B and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...
-
Recently I took a test where I was given these two limits to evaluate: lim and $\lim_\limi...
-
I need to give an explicit bijection between (0, 1] and [0,1] and I'm wondering if my bijection/proof is correct. Using the hint tha...
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
No comments:
Post a Comment