Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Show that is a multiple of for every integer . Work with congruences modulo , and and try every remainder. Then show that is the best possible: no larger integer divides for every . Give the largest integer that always divides , and the value of at .
means . Congruences add, subtract, multiply and take powers like equations. A small power congruent to or cuts a large exponent down:
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. for all integers .
Plan. Since , and are coprime, it is enough to show that each divides .
Step 1. Factor. .
Step 2. Modulo 2 and 3. The product of three consecutive integers contains a multiple of and a multiple of . So and .
Step 3. Modulo 5. If or , one of , , is a multiple of . If or , then , so . Every case gives .
Step 4. Combine. , and all divide and share no factor, so .
Step 5. Best possible. At we get . Any integer that divides every divides , so no number above works.
Answer: always divides , the value at is , and is the largest such divisor. Proof complete.
What if? The same method shows that is always a multiple of , and is best possible.
Log in to join the discussion.
Loading…