Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /233 of 395

Saudi Arabian Mathematical Competitions, 2012

Geometry Difficulty 5.8 AIME, harder Prove it Saudi Arabia

Let ABCDABCD be a square. Points EE and FF lie on sides CDCD and DADA, respectively, such that EBF‾=45∘\overline{EBF} = 45^\circ. Given that DE=1234DE = 12^{34}, determine the number of triples (k,m,n)(k, m, n) of positive integers with AB=kAB = k, DF=mDF = m, and EF=nEF = n.

Solution

Let DBE^=x\widehat{DBE} = x, DBF^=y\widehat{DBF} = y, and construct the point E′E' on the ray DADA such that E′BA^=y\widehat{E'BA} = y.

Figure 1

The triangles BECBEC and BE′ABE'A are congruent, so BE′=BEBE' = BE. Also, we have △BEF≅△BE′F\triangle BEF \cong \triangle BE'F by SAS congruency.

From E′F=E′A+AF=EC+AF=(k−1234)+k−mE'F = E'A + AF = EC + AF = (k - 12^{34}) + k - m and E′F=EF=nE'F = EF = n, it follows n=(k−1234)+(k−m)n = (k - 12^{34}) + (k - m), and hence we get
k=12(m+n+1234).(1) k = \frac{1}{2}(m + n + 12^{34}). \quad (1)
The triples (k,m,n)(k, m, n) are in bijection with the pairs (m,n)(m, n) satisfying m2+1268=n2m^2 + 12^{68} = n^2. Indeed, any integral solution (m,n)(m, n) to m2+1268=n2m^2 + 12^{68} = n^2 satisfies m≡n(mod2)m \equiv n \pmod 2, meaning kk is an integer. We can write
1268=n2−m2=(n−m)(n+m)=4⋅n−m2⋅n+m2,(2) 12^{68} = n^2 - m^2 = (n - m)(n + m) = 4 \cdot \frac{n - m}{2} \cdot \frac{n + m}{2}, \quad (2)
which is the same as
2134⋅368=n−m2⋅n+m2.(3) 2^{134} \cdot 3^{68} = \frac{n-m}{2} \cdot \frac{n+m}{2}. \quad (3)
For every divisor dd of 2134⋅3682^{134} \cdot 3^{68}, with d2<2134⋅368d^2 < 2^{134} \cdot 3^{68}, we obtain a solution n−m2=d\frac{n-m}{2} = d, n+m2=2134⋅368d>d\frac{n+m}{2} = \frac{2^{134} \cdot 3^{68}}{d} > d and conversely. We get 135⋅69−12\frac{135 \cdot 69 - 1}{2} solutions since 2134⋅3682^{134} \cdot 3^{68} has 135⋅69135 \cdot 69 divisors.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.