(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Prove by induction on n that n belonging to N (set of natural #'s)

2^{n}> n

2. Relevant equations

3. The attempt at a solution

So here's my stab at it!

Base case: n = 0 (My prof includes 0 in N)

2^{0}> 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(2^{k}) > k + 1

> 2k

OR

2^{k}+ 1 > k + 1

And with either one, how do I continue??

Eekkk. any help is appreciated! Thanks.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Simple Induction Proof

**Physics Forums | Science Articles, Homework Help, Discussion**