Problem:
Show that there are infinitely many odd composite numbers in the sequence , , , , ... .
Solution
Solution:
We show that infinitely many odd numbers in the sequence are divisible by .
If , then for some . So there are odd numbers in the sum and even numbers. Hence the sum is odd.
There are numbers equal to , equal to and equal to .
Any product of numbers equal to equals , so if , then . Similarly, if , then . If then if is odd and mod if is even.
Of the numbers equal to , are even and are odd. Hence the sum .
So the sum is divisible by .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.