Part (a)
2 marks
Since , we have for , with checked separately.
Subtracting,
Note: this formula also holds at , since agrees with .
| To check your answer: , matching ✓ |
.
Part (c)
2 marks
Approach
has common difference and has common difference , so a number common to both progressions recurs with period . Rather than listing terms of each series until one matches, we find one common term algebraically using modular arithmetic, restricting the search to terms exceeding .
Terms of exceed when
giving
For a term to lie in both series, we need for positive integers :
Taking both sides mod 3 (using and ),
since is its own inverse mod 3. So . The smallest such with (so that ) is :
| To check your answer: , an integer, so ✓ |
the smallest number greater than 100 in both series is .
Part (d)(i)
2 marks
Approach
since depends on the parity of , we check even and odd separately, writing or .
If ,
and are both even, so .
If ,
and are both even, so .
in both cases is odd, so every term of series is odd. (shown)
Part (d)(ii)
1 mark
is even for every integer , and is even, so for every — every term of is even.
Since every term of is odd (part (i)) and every term of is even, no term of can equal a term of .
series and series have no terms in common.