GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

GeekInterview.com  >  Placement Papers  >  Infosys  >  Challenging Puzzles
Go To First  |  Previous Question  |  Next Question 
 Challenging Puzzles  |  Question 3 of 200    Print  
Given two billion distinct points on a plane such That no three are collinear. I color any half of them red and the Remaining blue. Is it always possible for you to join each red point to one (and Only one) blue point by means of line segments such that no two line segments Intersect?

  
Total Answers and Comments: 4 Last Update: June 16, 2008   
  
 Sponsored Links

 
 Best Rated Answer

No best answer available. Please pick the good answer available or submit your answer.
July 10, 2005 03:51:34   #1  
john        

RE: Given two billion distinct points on a plane such That no three are collinear. I color any half of t...
hai , 
 
can the answer be a regular fig like a circle on which only two points r collinear i.e ends of diameter nd all the other conditions can also satisfied.....if any one knows the answer kindly post the ans to me 
 
Truly 
john

 
Is this answer useful? Yes | No
August 08, 2005 21:30:20   #2  
raj_893        

RE: Given two billion distinct points on a plane such That no three are collinear. I color any half of t...
Hi folks!!!!!!!!!!!! 
 
given that joining is by line segments..... 
a circle can be drawn from any 3 non-collinear points. but once the no. of points crosses 3 ,drawing a cirle is possible only under special conditions.... I think joining by lines is not always possible. only if every two blue lines ( joining two points) are parellel. only then all points can still lie in one plane and still not intersect.................... 
 
truly 
 
raj.

 
Is this answer useful? Yes | No
August 10, 2005 18:05:42   #3  
Vasanth        

RE: Given two billion distinct points on a plane such That no three are collinear. I color any half of t...
The question does not say that each red point has to be joined to a distinct blue point, atleast to my understanding. 
 
If that is the case, we can pick any single blue point and join all red points to that single blue point by lines and none of them would intersect. 
 
They would not intersect because all these line segments originate from one single point and hence they cannot intersect but can only overlap if any three points are collinear, which is not the case either.

 
Is this answer useful? Yes | No
June 16, 2008 14:32:04   #4  
abhay_bksc Member Since: June 2008   Contribution: 3    

RE: Given two billion distinct points on a plane such That no three are collinear. I color any half of them red and the Remaining blue. Is it always possible for you to join each red point to one (and Only one) blue point by means of line segments such th
if all points lie of a circle then it is possible to draw parallel lines.
 
Is this answer useful? Yes | No


 
Go To Top


 Sponsored Links

 




About Us  |   Privacy Policy  |   Terms and Conditions  |   Contact  |   Site Map  |   Add Question  |   Propose Category  |   RSS Feeds  |   Articles Sitemap  |   Site Updates  |   Add Resource

Copyright © 2005 - 2008 GeekInterview.com. All Rights Reserved
Page copy protected against web site content infringement by Copyscape