Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A student notices that , and are all multiples of . She guesses that for every integer .
Give the largest whole number that divides for all .
Division algorithm: with , and , are unique. If and , then . To prove a fact for every integer, split into cases by the remainder.
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. The claim for every integer .
Plan. Factorise, then show that , and each divide the product. They share no factor, so their product divides it.
Step 1. Factorise. .
Step 2. The primes 2 and 3. is a product of three consecutive integers. One of them is even and one is a multiple of .
Step 3. The prime 5. Write with .
In every case divides the product.
Step 4. Combine. The primes , and all divide . By the fundamental theorem their product divides it too.
Step 5. Nothing larger works. A number that divides for every must divide the value at , which is . So it is at most .
Answer: for all integers , and is the largest such number. Proof complete.
What if? The same method shows . Course 2 of the next chapter explains the pattern with Fermat's little theorem.
Log in to join the discussion.
Loading…