Maths Olympiad Prep

Library / /456 of 520

Number theory Difficulty 5.8 AIME, harder Prove it

Three. (25 points) Given the theorem: "If three prime numbers greater than 3, a,ba, b, and cc, satisfy the equation 2a+5b=c2a + 5b = c, then a+b+ca + b + c is a deficient number of the integer nn." What is the maximum possible value of the integer nn in the theorem? Prove your conclusion.

Solution

Three, the maximum possible value of nn is 9.
First, prove that a+b+ca+b+c can be divided by 3.
In fact, a+b+c=a+b+2a+5b=3(a+2b)a+b+c=a+b+2a+5b=3(a+2b), so a+b+ca+b+c is a multiple of 3.
Let the remainders when aa and bb are divided by 3 be rar_{a} and rbr_{b}, respectively, then ra0,rb0r_{a} \neq 0, r_{b} \neq 0.
If rarbr_{a} \neq r_{b}, then ra=1,rb=2r_{a}=1, r_{b}=2 or ra=2,rb=1r_{a}=2, r_{b}=1. In this case, 2a+5b2a+5b must be a multiple of 3, i.e., cc is a composite number, which is a contradiction.
Therefore, ra=rbr_{a}=r_{b}, then ra=rb=1r_{a}=r_{b}=1 or ra=rb=2r_{a}=r_{b}=2,
In this case, a+2ba+2b must be a multiple of 3, thus a+b+ca+b+c is a multiple of 9.
Next, prove that 9 is the largest.
2×11+5×5=47, and 11+5+47=63 \because 2 \times 11+5 \times 5=47 \text {, and } 11+5+47=63 \text {, }

While in 2×13+5×7=612 \times 13+5 \times 7=61, 13+7+61=8113+7+61=81, and (63,81)=9(63, 81)=9, hence 9 is the largest possible value.

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.