1^4+2^4+3^4+..........+n^4 =n(n+1)(2n+1)+(3n^2+3n-1)/30. (whole divided by 30)
to prove the given result by mathematical induction method, first we will show that it is true for n=1
then we will assume that it is true for n = k, and with the help of assumption we will try to prove that the given result is true for n = k+1.
step I:
P(1) = 1
RHS =
thus the given equation holds for n =1
step II:
let us assume that given equation holds for n = k
therefore
step III:
now let us find the sum for n = (k+1)
now we will find the factor of
thus is a factor of g(k).
now k = -3/2 is a factor of g(k).
thus by the factorization we can write:
therefore
thus the given equation also holds for n = k+1.
thus it is true for all integer values of n.
hope this helps you
then we will assume that it is true for n = k, and with the help of assumption we will try to prove that the given result is true for n = k+1.
step I:
P(1) = 1
RHS =
thus the given equation holds for n =1
step II:
let us assume that given equation holds for n = k
therefore
step III:
now let us find the sum for n = (k+1)
now we will find the factor of
thus is a factor of g(k).
now k = -3/2 is a factor of g(k).
thus by the factorization we can write:
therefore
thus the given equation also holds for n = k+1.
thus it is true for all integer values of n.
hope this helps you