# Thread:

1. ## Induction n^2 > 2n  for n>2

Prove n^2 > 2n for n>2 by induction

Check n = 3
9 > 6
Say it is true for n
now check for n+1

This is where I am worried that what I'm doing isn't enough proof

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

n^2+2n+1 > 2n +2

by cancelling

n^2 > 1

we know that n > 2 so n^2 is always going to be greater than 1.

Does this suffice?

2. Hi

The idea behind what you use is a non-inductive proof, which is:

Let $n>2$ be an integer, $n^2>2n \Leftrightarrow n>2$ (the equivalence is true because n positive integer). Since we assumed $n>2,$ we have what we want.

In a usual proof by induction, you assume your induction hypothesis (case $n$) and try to show the statement for $n+1,$ using the case $n.$

So for your proof, writing $(n+1)^2=n^2+2n+1$ is a good thing. What you have to do now is to obtain $n^2+2n+1>2(n+1),$ using the induction hypothesis: $n^2>2n$

3. Ok how bout this

Step 1 as above

Step 2 (I need to prove (n+1)^2 > 2(n+1)

(n+1)^2=n^2 +2n +1
>2n + 2n +1 (Using induction)
= 4n +1
= 2(n+1) +2n -1 (2n-1) is always positive for n>2
>2(n+1)

Should i be using k instead?

4. What you've done is correct, no need to choose another letter.
{"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": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9230841398239136, "perplexity_flag": "middle"}