Difference between revisions of "1992 IMO Problems/Problem 5"

(Solution)
(Solution)
Line 9: Line 9:
 
==Solution==
 
==Solution==
  
Let <math>Z_{i}</math> be a plane with index <math>i</math> such that <math>1 \le i \le n</math> that are parallel to the <math>xy</math>-plane that contain multiple points
+
Let <math>Z_{i}</math> be planes with index <math>i</math> such that <math>1 \le i \le n</math> that are parallel to the <math>xy</math>-plane that contain multiple points of <math>S</math> on those planes such that all points of <math>S</math> are distributed throughout all planes <math>Z_{i}</math> according to their <math>z</math>-coordinates in common.
  
 +
Let <math>a_{i}</math> be the number of unique projected points from each <math>Z_{i}</math> to the <math>yz</math>-plane
 +
 +
Let <math>b_{i}</math> be the number of unique projected points from each <math>Z_{i}</math> to the <math>xz</math>-plane
 +
 +
This provides the following:
 +
 +
<math>|Z_{i}| le a_{i}b_{i}</math>
  
  

Revision as of 14:12, 12 November 2023

Problem

Let $S$ be a finite set of points in three-dimensional space. Let $S_{x}$,$S_{y}$,$S_{z}$, be the sets consisting of the orthogonal projections of the points of $S$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that

\[|S|^{2} \le |S_{x}| \cdot |S_{y}| \cdot |S_{z}|,\]

where $|A|$ denotes the number of elements in the finite set $|A|$. (Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane)

Solution

Let $Z_{i}$ be planes with index $i$ such that $1 \le i \le n$ that are parallel to the $xy$-plane that contain multiple points of $S$ on those planes such that all points of $S$ are distributed throughout all planes $Z_{i}$ according to their $z$-coordinates in common.

Let $a_{i}$ be the number of unique projected points from each $Z_{i}$ to the $yz$-plane

Let $b_{i}$ be the number of unique projected points from each $Z_{i}$ to the $xz$-plane

This provides the following:

$|Z_{i}| le a_{i}b_{i}$



Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.