Consider-n-red-and-n-blue-points-in-the-plane-no-three-of-them-being-collinear-Prove-that-one-can-connect-each-red-point-to-a-blue-one-with-a-segment-such-that-no-two-segments-intersect-

FacebookTweetPin

Question Number 13891 by Tinkutara last updated on 24/May/17

$$\mathrm{Consider}n\mathrm{red}\mathrm{and}n\mathrm{blue}\mathrm{points}\mathrm{in}$$$$\mathrm{the}\mathrm{plane},\mathrm{no}\mathrm{three}\mathrm{of}\mathrm{them}\mathrm{being}\mathrm{collinear}.$$$$\mathrm{Prove}\mathrm{that}\mathrm{one}\mathrm{can}\mathrm{connect}\mathrm{each}\mathrm{red}$$$$\mathrm{point}\mathrm{to}\mathrm{a}\mathrm{blue}\mathrm{one}\mathrm{with}\mathrm{a}\mathrm{segment}$$$$\mathrm{such}\mathrm{that}\mathrm{no}\mathrm{two}\mathrm{segments}\mathrm{intersect}.$$

Commented by mrW1 last updated on 25/May/17

$$WhenIimagethatthesesegments$$$$werematchesofdifferentlength$$$$andtheredpointsweretheheadsof$$$$thematches,Iknowitisalways$$$$possibletoplacethematchesona$$$$tablesuchthatthey{don}^{\prime }tlieovereach$$$$other.$$

Terms of Service
Privacy Policy
Contact: info@tinkutara.com

FacebookTweetPin