Let ABCD be a square and let ℓ be a line. Let M be the centre of the square. The diagonals of the square have length 2 and the distance from M to ℓ exceeds 1. Let A′,B′,C′,D′ be the orthogonal projections of A,B,C,D onto ℓ. Suppose that one rotates the square, such that M is invariant. The positions of A,B,C,D,A′,B′,C′,D′ change. Prove that the value of AA′2+BB′2+CC′2+DD′2 does not change.
Solution
1. Define the coordinates and properties of the square: - Let the center M of the square be the origin (0,0). - The diagonals of the square have length 2, so the side length of the square is 2. - The vertices of the square A,B,C,D can be represented as: A=(22,22),B=(−22,22),C=(−22,−22),D=(22,−22)
2. **Define the line ℓ and the projections:** - Let ℓ be a line at a distance d from the origin M, where d>1. - The orthogonal projections of A,B,C,D onto ℓ are A′,B′,C′,D′.
3. **Calculate the distance from each vertex to the line ℓ:** - Let the equation of the line ℓ be ax+by+c=0. - The distance from a point (x1,y1) to the line ax+by+c=0 is given by: Distance=a2+b2∣ax1+by1+c∣ - For each vertex A,B,C,D, the distances to the line ℓ are: Distance from A=a2+b2∣a22+b22+c∣ Distance from B=a2+b2∣a(−22)+b22+c∣ Distance from C=a2+b2∣a(−22)+b(−22)+c∣ Distance from D=a2+b2∣a22+b(−22)+c∣
4. Sum of the squares of the distances: - Let k=a2+b2∣c∣, which is the distance from the origin to the line ℓ. - The sum of the squares of the distances from the vertices to the line ℓ is: AA′2+BB′2+CC′2+DD′2=(a2+b2∣a22+b22+c∣)2+(a2+b2∣a(−22)+b22+c∣)2+(a2+b2∣a(−22)+b(−22)+c∣)2+(a2+b2∣a22+b(−22)+c∣)2
5. Simplify the expression: - Notice that the terms involving a and b will cancel out due to symmetry, leaving: AA′2+BB′2+CC′2+DD′2=4k2+2(22)2+(22)2 - Simplify further: AA′2+BB′2+CC′2+DD′2=4k2+2(21+21)=4k2+2
6. Conclusion: - Since k is the distance from the origin to the line ℓ, which is fixed, and the term 2 is constant, the value of AA′2+BB′2+CC′2+DD′2 does not change when the square is rotated.
■
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.