# Thread:

1. ## induction problem

i think this one is pretty easy but i'm not that great with induction. any help?

Show that $2^n > n$ for any integer n that is an element of $Z^+.$

my attempt:

base case - let n=1
2^1=2 > 1 -> base case is true

2^(n+1) > n+1
2^n + 2 > n+1
2^n > n-1

statement holds true by the base case 2^1 > 1-1

2. For n=1, $2^{1} = 2 > 1$.

Now Assume $2^{k} > k$ for some k>1

then $2^{k+1} = 2*2^{k} > 2k$ by the induction step

and $2k = k+k > k+1$ which is what we wanted to show
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 6, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8790494799613953, "perplexity_flag": "middle"}