help aggain plz
@Agl202
first check is n=1 true statement or not ? substitute n for 1
how do i do that
sorry im really slow today i jsut got home from base
\[n^2-n+2 =2 \] substitute n for 1 do you get equal sides ?
not really sorry
these are the steps for mathematical induction `1st)` substitute n for 1 to check is the L.H.S = R.H.S ? if the statement is true then next step is `2nd)` assume it is true for n=k (substitute n for k) this step is called " induction assumption' `3rd)` substitute n for k+1 and we want to show the statement is true for n= k+1 based on the 2nd step assumption
ohh ok
what do you mean replace n with one and then solve left side both sides are equal at the end ?
what?? im confused
why did you ask that question for?
@surjithayer plz help me im so confused rn
\(\color{blue}{\text{Originally Posted by}}\) @Nnesha \[n^2-n+2 =2 \] substitute n for 1 do you get equal sides ? \(\color{blue}{\text{End of Quote}}\) this is simple algebra substitute n for 1 then solve left side
if both sides are equal THEN we can work on 2nd step
and how do we do that
??
do what ?
\[n^2-n+2=2\]replace n with one
@Directrix
@freckles @Hero
Join our real-time social learning platform and learn together with your friends!