Three. (25 points) Given the theorem: "If three prime numbers greater than 3, , and , satisfy the equation , then is a deficient number of the integer ." What is the maximum possible value of the integer in the theorem? Prove your conclusion.
Solution
Three, the maximum possible value of is 9.
First, prove that can be divided by 3.
In fact, , so is a multiple of 3.
Let the remainders when and are divided by 3 be and , respectively, then .
If , then or . In this case, must be a multiple of 3, i.e., is a composite number, which is a contradiction.
Therefore, , then or ,
In this case, must be a multiple of 3, thus is a multiple of 9.
Next, prove that 9 is the largest.
While in , , and , 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.