Prove by induction that the sum of the first n integers can be written as (1/2)(n)(n+1).

For n = 1, the sum is given by (1/2)(1)(1+1), which gives 1, the expected result. We now assume that the statement is true for some k. If we look at k+1, the sum is given by 1 + 2 + ... + k + (k+1). Since we have assumed that 1 + 2 + ... + k = (1/2)(k)(k+1), this can be rewritten as (1/2)(k)(k+1) + (k+1). Simplifying this gives (1/2)(k+1)(k+2), which is the required result. If the statement is true for n = k, we have shown it to be true for n = k + 1. Since the statement is true for n = 1, it is shown to be true for all n >= 1.

Related Further Mathematics A Level answers

All answers ▸

Integrate f(x) = 1/(1-x^2)


Sketch the locus of z on an Argand diagram if arg[(z-5)/(z-3)] = π/6


Solve the inequality x^3 + x^2 > 6x


Let f(x)=x^x for x>0, then find f'(x) for all x>0.


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences