# Math Help - Mathematical Induction proving

1. ## Mathematical Induction proving

$n^{3}+2n$

prove that it is divisible by 3 for any integer $n\geq 1$
the steps i use are
1) plug in a number to see if its true 1+2 = 3 is divisible by 3= true
2). K=N plug it in $k^{3}+2k$
3) K+1 =N plug it in $k^{3}+2k+ (k+1)^{3} +2(k+1)$ ---- this is where I'm confused i usually have numbers for example 1+3+4+5+.......(3n+2) = n(n+1)
I'm not sure if step 3 is right because that's what i do for my usual example with numbers

2. ## Re: Mathematical Induction proving

Hint: add $(n+1)^3+2(n+1)-(n^3+2n)=3(n^2+n+1)$ to your induction hypothesis.

3. ## Re: Mathematical Induction proving

Same thing:
$(n+1)^3+ 2(n+1)= n^3+ 3n^2+ 3n+ 1+ 2n+ 2= (n^3+ 2n)+ (3n^2+ 3n+ 3)= (n^3+2n)+ 3(n^2+ n+ 1)$.
{"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, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9737637639045715, "perplexity": 1883.9953205542301}, "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": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422115855845.27/warc/CC-MAIN-20150124161055-00144-ip-10-180-212-252.ec2.internal.warc.gz"}