Find 100 consecutive natural numbers, each of which is composite

So this is the sort of quesition where you will spend a while thinking about it, probably feel a little silly you haven't gotten it yet, then go "aha!", write down the answer and move on. It's all about spotting the trick.
Here the trick is to consider 101!, this is a number that is divisible by 2,3,...,100,101. So our list of 100 consecutive numbers is:
101! + 2,101! +3,...101!+100,101!+101
This works as each 101! + k is divisible by k as 101! and k both are.

GV

Related STEP University answers

All answers ▸

Show that if a polynomial with integer coefficients has a rational root, then the rational root must be an integer. Hence, show that x^n-5x+7=0 has no rational roots.


How would you prove the 'integration by parts' rule?


Let p and q be different primes greater than 2. Prove that pq can be written as difference of two squares in exactly two different ways.


Prove that any number of the form pq, where p and q are prime numbers greater than 2, can be written as the difference of two squares in exactly two distinct ways.