Maths Olympiad Prep

Library / /345 of 520

Number theory Difficulty 5.5 AIME, harder Find the answer

Example 13 Consider the equation m2+(k4)mm^{2}+(k-4) m +k=0+k=0 with respect to mm. Let the largest integer root of this equation be the diameter of O\odot O. Let PP be a point outside O\odot O, and draw the tangent PAP A and the secant PBCP B C through PP, as shown in Figure 1, with AA being the point of tangency. It is found that PA,PB,PCP A, P B, P C are all integers, and PB,BCP B, B C are not composite numbers. Find the lengths of PA,PB,PCP A, P B, P C.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Solution: Let the two roots of the equation be m1m_{1} and m2m_{2}, then
{m1+m2=4k,m1m2=k. \left\{\begin{array}{l} m_{1}+m_{2}=4-k, \\ m_{1} m_{2}=k . \end{array}\right.

Let PA=x,PB=y,BC=zP A=x, P B=y, B C=z, then x,y,zx, y, z are all positive integers.
By the secant-tangent theorem, we have
PA2=PBPC=PB(PC+3C), P A^{2}=P B \cdot P C=P B(P C+3 C),

which means
x2=y2+y(x+y)(xy)=yz x^{2}=y^{2}+y \Rightarrow(x+y)(x-y)=y z \text {. }

Eliminating kk from (1) and the equation, we get
m1m2=4m1m2 m_{1} m_{2}=4-m_{1}-m_{2} \text {. }

Rearranging and factoring, we get
(m1+1)(m2+1)=5 \left(m_{1}+1\right)\left(m_{2}+1\right)=5 \text {. }

Since the diameter of O\odot O is the largest integer root of the equation, it is not difficult to find that the maximum integer root m=4m=4. Thus, z=BC4z=B C \leqslant 4.
Since the positive integer zz is not a composite number, hence z=3,2,1z=3,2,1.
When z=3z=3, (x+y)(xy)=3y(x+y)(x-y)=3 y, we have
{x+y=3,xy=y;x+y=y,xy=3;{x+y=3y,xy=1. \left\{\begin{array}{l} x+y=3, \\ x-y=y ; \end{array} \left\lvert\, \begin{array}{l} x+y=y, \\ x-y=3 ; \end{array}\left\{\begin{array}{l} x+y=3 y, \\ x-y=1 . \end{array}\right.\right.\right.

The solution that fits the problem is x=2,y=1x=2, y=1.
When z=1z=1 and z=2z=2, there are no solutions that fit the problem,
Therefore, PA=x=2,PB=y=1,PC=y+P A=x=2, P B=y=1, P C=y+ z=4z=4.

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.