Maths Olympiad Prep

Library / /386 of 520

Number theory Difficulty 6.5 National olympiad Prove it

11. When the integer aa is divided by the interger bb where b>0b>0, the division algorithm gives a quotient of qq and a remainder of rr. Show that if b ab \ a, when a-a is divided by bb, the division algorithm gives a quotient of (q+1)-(q+1) and a remainder of brb-r, while if bab \mid a, the quotient is q-q and the remainder is zero.

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.