1. Prove Sn is true for n = 1

2. Assume Sn is true for n = k

3. Try to prove Sn is true for n = k + 1

4. Hence, Sn is true for all positive integers n

To be divisible
integer needs to be a factor of that number

Represent with

Horizontal
Vertical

Positive = right and up
Negative = left and down

Add vertical and horizontal components

Multiply each component by separate non-vector integer

square root of
x-value squared + y-value squared

Magnitude of 1

Equals to co-efficient in actual equation

same for Rsin

R = co-efficient squared and then square rooted

Sub x = pi into original equation

Quadrants 2 & 4

Quadrants 1 & 3

• pi

Further Calculus Skills