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.
3197 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Integrate xsin(x).
Find the area of the surface generated when the curve with equation y=cosh(x) is rotated through 2 pi radians about the x axis, with 2<=x<=6
Given that p≥ -1 , prove by induction that, for all integers n≥1 , (1+p)^k ≥ 1+k*p.
The finite region bounded by the x-axis, the curve with equation y = 2e^2x , the y-axis and the line x = 1 is rotated through one complete revolution about the x-axis to form a uniform solid. Show that the volume of the solid is 2π(e^2 – 1)