Maths Olympiad Prep

Library / /109 of 520

Algebra Difficulty 5.6 AIME, harder Prove it

(1) Associative Law of Addition For any a,b,cNa, b, c \in \boldsymbol{N}, we have
(a+b)+c=a+(b+c).(a+b)+c=a+(b+c) .

Solution

Prove that when c=ec=e, for any a,bNa, b \in \boldsymbol{N}, from equations (1) and (2) we get
(a+b)+e=(a+b)+=a+b+=a+(b+e),(a+b)+e=(a+b)^{+}=a+b^{+}=a+(b+e),

so equation (8) holds. Assume that equation (8) holds for some c=nc=n and any a,bNa, b \in \boldsymbol{N}. When c=n+c=n^{+}, for any a,bNa, b \in \boldsymbol{N}, we have (using equation (2) and the assumption)
(a+b)+n+=((a+b)+n)+=(a+(b+n))+=a+(b+n)+=a+(b+n+)\begin{aligned} (a+b)+n^{+} & =((a+b)+n)^{+}=(a+(b+n))^{+} \\ & =a+(b+n)^{+}=a+\left(b+n^{+}\right) \end{aligned}

Thus, equation (8) holds for c=n+c=n^{+} and any a,bNa, b \in \boldsymbol{N}. By the principle of mathematical induction, the conclusion is proved.

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.