Prove by induction the sum of the natural numbers from 1 to n is n(n+1)/2
Need whiteboard throughout to properly answer, so will go through the ideas of what to do:
Take the base case of when n=1, and show that (sum from 1 to 1) j = n(n+1)/2 is equal to 1.
Take the assumption that this is true for some n=k in the natural numbers. So want to show it's true for n=k+1.
Use the sigma notation to split the sum from 1 to k+1 to the sum from 1 to k, and adding k+1. We have assumed that
(sum from 1 to k) j = k(k+1)/2, so we now have that (sum from 1 to k) j + (k+1) = k(k+1)/2 + (k+1), and we can then show that this is equal to (k+1)(k+2)/2.
So since we have shown that the statement is true for a base case, and that if it is true for n=k, it is also true for n=k+1, then we have proved the statement by the mathematical principle of induction.
3177 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Why is the integral of 1/sqrt(1-x^2)dx = sin^{-1}(x)?
Find the equation of the tangent to the curve y = exp(x) at the point ( a, exp(a) ). Deduce the equation of the tangent to the curve which passes through the point (0,1) .
Given that x = i is a solution of 2x^3 + 3x^2 = -2x + -3, find all the possible solutions
prove by induction that, f(n) = 2^(3n+1) + 3(5^(2n+1)) is divisible by 17 for all n>0.