- #1
missavvy
- 82
- 0
Homework Statement
Prove by induction on n that n belonging to N (set of natural #'s)
2n > n
Homework Equations
The Attempt at a Solution
So here's my stab at it!
Base case: n = 0 (My prof includes 0 in N)
20 > 0, 1 >0
True. So this works for the base case.
Assume this holds for n. Let n = k+1
2(k+1) > k + 1
Here is where I'm a bit confused..
I'm not sure if it should be:
2(2k) > k + 1
> 2k
OR
2k + 1 > k + 1
And with either one, how do I continue??
Eekkk. any help is appreciated! Thanks.