# Thread:

1. ## induction proof of de moivres formula

Is this correct and enough proof
$(cosx+isinx)^n=cos(nx)+isinx$ is true so i put 1 and its true now ima prove for
$S(k+1) = (Cosx+isinx)^k+1= (Cosx+isinx)^k(cosx+isinx)$ now we can rewrite that ^k with a formula i cant remember as
$(coskx+isinkx)(cosx+isinx)$
and now i foctour out cos x and sin x
$Cos x ( k+1) + iSinx(k+1)$
is this enough

2. ## Re: induction proof of de moivres formula

You "can't remember"? You just wrote it two lines above!
For n a positive integer, yes, that will be a valid proof once you use trig identities to show how you got from $(cos(kx)+ isin(kx))(cos(x)+ i sin(x))$ to $cos((k+1)x)+ i sin((k+1)x)$.

DeMoivre's formula is true for n any number, of course, not just positive integers. It would think the simplest way to prove it is to use the fact that $cos(x)+ i sin(x)= e^{ix}$.
{"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": 7, "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": 20, "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.8820390701293945, "perplexity_flag": "middle"}