how can we proving one equation with math induction ?
first check for k=1 then assume k=n is true and try to prove that the equation holds true even for k=n+1, hence through mathematical induction u'll prove the result is true :)
can you write me one example please ?
say i need to prove the summation of 1+2+3...till n is n(n+1)/2 check for k=1 by formula u get=1(1+1)/2=1 so lets now assume the formula holds for n , now for k=n+1 , the sum is n(n+1)/2+(n+1) where n(n+1)/2 is the sum till n terms,we are using it here since we've assumed it to be true. now simplify the term n(n+1)/2+(n+2) we'll get (n+1)(n+2)/2 which proves it.
can you prove in this way one equation like n=a+b+1 - where a and b are grater or equal 1 and n are greater or equal 3 and a,b,n are numbers natural from N ?
i don't understand how u can proceed with this substitution.....
how can be proven that for any value of n will be always one number a and one number b such that this equation is true
like 3=1+1+1
are you helping me with 9-x^2 ? If so, I have no clue to what ur saying.
Join our real-time social learning platform and learn together with your friends!