Difference between revisions of "1971 IMO Problems/Problem 5"
(Created page with "Prove that for every natural number m; there exists a finite set S of points in a plane with the following property: For every point A in S; there are exactly m points in S which...") |
|||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
− | Prove that for every natural number m; there exists a finite set S of points | + | ==Problem== |
− | in a plane with the following property: For every point A in S; there are | + | Prove that for every natural number <math>m</math>; there exists a finite set <math>S</math> of points in a plane with the following property: For every point <math>A</math> in <math>S</math>; there are exactly <math>m</math> points in <math>S</math> which are at unit distance from <math>A</math>. |
− | exactly m points in S which are at unit distance from A. | + | |
+ | ==Solution 1== | ||
+ | I shall prove a more general statement about the unit distance graph(<math>V=\mathbb{R}^2</math>, adjacency iff the Euclidean distance between the points is <math>1</math>) and this will follow as a consequence. | ||
+ | if <math>G,H</math> occur as unit distance graphs, then so does <math>G\times H</math>( here <math>G\times H</math> is described as <math>V(G\times H)=V(G)\times V(H), (v_1,w_1)\leftrightarrow (v_2,w_2) \Leftrightarrow v_1=v_2,w_1\leftrightarrow w_2</math> or <math>v_1\leftrightarrow v_2,w_1=w_2</math>). | ||
+ | this is seen by describing the vertices by complex numbers. suppose there is an embedding of <math>G</math> by the complex numbers <math>v_1,v_2\ldots,v_n</math> and for <math>H</math> by the numbers <math>w_1,w_2,\ldots, w_m</math>. we claim that for some choice of <math>0\leq\theta<2\pi</math>, <math>v_i+e^{i\theta}w_j</math> will do the job(a suitable rotation). | ||
+ | what we need is that <math>(v_i+e^{i\theta}w_j)\leftrightarrow (v_k+e^{i\theta}w_l)</math> iff either <math>v_i=v_k,|w_j-w_l|=1</math> or <math>w_j=w_l,|v_i-v_k|=1</math>. clearly if the condition holds then the adjacency is satisfied. suppose <math>i\neq k,j\neq l</math> and that the corresponding complex numbers are at a distance <math>1</math> from one another. Then this gives a quadratic in <math>e^{i\theta}</math> and hence <math>\theta</math> can take only finitely many values here.ruling this out for each such set of <math>i,j,k,l</math> hence rules out finitely many values of <math>\theta</math> and therefore a suitable choice exists. | ||
+ | for the given problem we need a unit distance graph which is regular of degree <math>m</math> for any given <math>m</math>. since we can form the graph <math>K_2</math>, we can form <math>Q_n=Q_{n-1}\times K_2</math>(the unit cube) and that solves the problem. | ||
+ | |||
+ | This solution was posted and copyrighted by seshadri. The original thread for this problem can be found here: [https://aops.com/community/p368343] | ||
+ | |||
+ | ==Solution 2== | ||
+ | Suppose <math>S</math> has the form<cmath>S_m=\left\{\sum_{\mathbf v \in U} \mathbf v \;\middle\vert\; U \subseteq V_m\right\}=\left\{\sum_{i=1}^m b_i \mathbf v_i \;\middle\vert\; b_i \in \{0,1\}\right\}\!,</cmath>where <math>V_m=\{\mathbf v_1,\mathbf v_2,\dots,\mathbf v_m\}</math> is unknown set of distinct unit vectors in <math>\mathbb R^2</math>. We can build <math>V_m</math> inductively, starting from the empty set and adding vectors to it, one by one. We just need to make sure that two thing are respected: | ||
+ | 1. All <math>2^m</math> vectors in <math>S_m</math> are distinct; | ||
+ | 2. Two vector sums are at unit distance from one another if and only if they differ in presence of exactly one summand (i.e. one and only one coefficient <math>b_i</math> in the sum changes from <math>0</math> to <math>1</math>). | ||
+ | If these two conditions are kept, then each of <math>2^m</math> points at <math>S_m</math> will be at unit distance from exactly <math>m</math> points corresponding to sums at which one and only one of <math>m</math> coefficients differs from coefficients of this point. However, respecting these conditions is not hard because <math>\left\|\sum_{\mathbf v \in U_1} \mathbf v - \sum_{\mathbf v \in U_2} \mathbf v\right\|=\left\|\sum_{\mathbf v \in U_1 \setminus U_2} \mathbf v \,-\! \sum_{\mathbf v \in U_2 \setminus U_1} \mathbf v\right\|</math> and for each new vector being added to <math>V_m</math> there is at most some finite set of forbidden endpoints given by sums/differences of already determined vectors but the rest of the (infinite) unit circle is permissible. | ||
+ | |||
+ | This solution was posted and copyrighted by Bandera. The original thread for this problem can be found here: [https://aops.com/community/p11000205] | ||
+ | |||
+ | == See Also == {{IMO box|year=1971|num-b=4|num-a=6}} |
Latest revision as of 14:09, 29 January 2021
Contents
Problem
Prove that for every natural number ; there exists a finite set of points in a plane with the following property: For every point in ; there are exactly points in which are at unit distance from .
Solution 1
I shall prove a more general statement about the unit distance graph(, adjacency iff the Euclidean distance between the points is ) and this will follow as a consequence. if occur as unit distance graphs, then so does ( here is described as or ). this is seen by describing the vertices by complex numbers. suppose there is an embedding of by the complex numbers and for by the numbers . we claim that for some choice of , will do the job(a suitable rotation). what we need is that iff either or . clearly if the condition holds then the adjacency is satisfied. suppose and that the corresponding complex numbers are at a distance from one another. Then this gives a quadratic in and hence can take only finitely many values here.ruling this out for each such set of hence rules out finitely many values of and therefore a suitable choice exists. for the given problem we need a unit distance graph which is regular of degree for any given . since we can form the graph , we can form (the unit cube) and that solves the problem.
This solution was posted and copyrighted by seshadri. The original thread for this problem can be found here: [1]
Solution 2
Suppose has the formwhere is unknown set of distinct unit vectors in . We can build inductively, starting from the empty set and adding vectors to it, one by one. We just need to make sure that two thing are respected: 1. All vectors in are distinct; 2. Two vector sums are at unit distance from one another if and only if they differ in presence of exactly one summand (i.e. one and only one coefficient in the sum changes from to ). If these two conditions are kept, then each of points at will be at unit distance from exactly points corresponding to sums at which one and only one of coefficients differs from coefficients of this point. However, respecting these conditions is not hard because and for each new vector being added to there is at most some finite set of forbidden endpoints given by sums/differences of already determined vectors but the rest of the (infinite) unit circle is permissible.
This solution was posted and copyrighted by Bandera. The original thread for this problem can be found here: [2]
See Also
1971 IMO (Problems) • Resources | ||
Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
All IMO Problems and Solutions |