Top answers

Further Mathematics
All levels

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 ...

Answered by Oisin O. Further Mathematics tutor
2025 Views

Simplify i^{4}?

Simplify i4?

We know that i = -11/2

Therefore i2=-1

As i4=i2xi2 

Then i4=-1x-1=1

Answered by Harry S. Further Mathematics tutor
2259 Views

The infinite series C and S are defined C = a*cos(x) + a^2*cos(2x) + a^3*cos(3x) + ..., and S = a*sin(x) + a^2*sin(2x) + a^3*sin(3x) + ... where a is a real number and |a| < 1. By considering C+iS, show that S = a*sin(x)/(1 - 2a*cos(x) + a^2), and find C.

C + iS = (acos(x) + a^2cos(2x) + a^3cos(3x) + ...) + i( asin(x) + a^2sin(2x) + a^3sin(3x) + ...)

= a(cos(x) + isin(x)) + a^2(cos(2x) + isin(2x)) + a^3(cos(3x) + ...

Answered by Salman F. Further Mathematics tutor
7942 Views

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...

Answered by Jason S. Further Mathematics tutor
2075 Views

Integral of ln x

xln(x) - x

Answered by Oscar G. Further Mathematics tutor
2271 Views

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