Maths Olympiad Prep

Library / /243 of 520

Number theory Difficulty 6.0 National olympiad Prove it

9. Give another proof of the division algorithm by using the well-ordering property. (Hint: When dividing aa by bb, take as the remainder the least positive integer in the set of integers aqba-q b. )

Solution

None

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.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.