Re: [algogeeks] novel written test

2011-06-28 Thread sagar pareek
@amit Check out your IQ On Tue, Jun 28, 2011 at 2:43 AM, amit kumar amitthecoo...@gmail.com wrote: how 2?? On Tue, Jun 28, 2011 at 2:40 AM, gmagog...@gmail.com gmagog...@gmail.comwrote: if( links can be melt and made into smaller links ) { return 1; } else { return 2;

Re: [algogeeks] novel written test

2011-06-28 Thread amit kumar
ohh its a straight chain..nt a rounded one.. gt it On Tue, Jun 28, 2011 at 12:42 PM, sagar pareek sagarpar...@gmail.comwrote: @amit Check out your IQ On Tue, Jun 28, 2011 at 2:43 AM, amit kumar amitthecoo...@gmail.comwrote: how 2?? On Tue, Jun 28, 2011 at 2:40 AM,

Re: [algogeeks] novel written test

2011-06-28 Thread Abhishek Bajaj
AMIT TWO IN CASE OF ONLY 2 PIECES ARE TO BE JOINED. ANSWER IS 4 AS U CAN CALCULATE I GUESS TO MAKE A STRAIGHT CHAIN FROM 3 BROKEN PIECES. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] novel written test

2011-06-27 Thread amit the cool
Conversation between two mathematicians: first : I have three children. The product of their ages is 36 . If you sum their ages . it is exactly same as my neighbor's door number on my left. The second mathematician verifies the door number and says that the not sufficient . Then the first says

Re: [algogeeks] novel written test

2011-06-27 Thread Piyush Sinha
1,6,6 On Tue, Jun 28, 2011 at 2:07 AM, amit the cool amitthecoo...@gmail.comwrote: Conversation between two mathematicians: first : I have three children. The product of their ages is 36 . If you sum their ages . it is exactly same as my neighbor's door number on my left. The second

[algogeeks] novel written test

2011-06-27 Thread amit the cool
A chain is broken into three pieces of equal lengths containing 3 links each. It is taken to a back smith to join into a single continuous one . How many links are to be opened to make it ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To

Re: [algogeeks] novel written test

2011-06-27 Thread amit kumar
@piyush..will u xplain plz. by d way 2 sons cant hav d same age(hope they r nt twins) On Tue, Jun 28, 2011 at 2:14 AM, Piyush Sinha ecstasy.piy...@gmail.comwrote: 1,6,6 On Tue, Jun 28, 2011 at 2:07 AM, amit the cool amitthecoo...@gmail.comwrote: Conversation between two mathematicians:

Re: [algogeeks] novel written test

2011-06-27 Thread udit sharma
Since the product of their ages is 36. So the possible combination of ages may b: either 1 4 9 or 4 3 3 6 6 1 1 2 18 1 3 12 1 1 36 2 2 9 Now neighbor's door numbr gives the sum.. Here all gives uniq sum except (sum=13) So there will be doubt in either 6 6 1 or 2 2 9 Bt as mathematician said tat

Re: [algogeeks] novel written test

2011-06-27 Thread gmagog...@gmail.com
Is it required that no two sons have the same age? From my view, the clue my youngest is the youngest only defines the requirement that the youngest one is unique, but he can still have two older brothers of the same age. Please correct me if this is wrong. Yanan Cao On Mon, Jun 27, 2011 at

Re: [algogeeks] novel written test

2011-06-27 Thread Piyush Sinha
We just need to look the 3 set of number that multiply to 36... the set can be as (1,1,36),(1,2,18),(1,4,9)..(1,6,6),(1,3,12)..(2,2,9) The catch here is we need not find the whole set...the second mathematician can't guess their ages through their sum that means there are at least

Re: [algogeeks] novel written test

2011-06-27 Thread sourabh jakhar
two On Tue, Jun 28, 2011 at 2:23 AM, amit the cool amitthecoo...@gmail.comwrote: A chain is broken into three pieces of equal lengths containing 3 links each. It is taken to a back smith to join into a single continuous one . How many links are to be opened to make it ? -- You received

Re: [algogeeks] novel written test

2011-06-27 Thread gmagog...@gmail.com
if( links can be melt and made into smaller links ) { return 1; } else { return 2; } Yanan Cao On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar sourabhjak...@gmail.comwrote: two On Tue, Jun 28, 2011 at 2:23 AM, amit the cool amitthecoo...@gmail.comwrote: A chain is broken into

Re: [algogeeks] novel written test

2011-06-27 Thread amit kumar
how 2?? On Tue, Jun 28, 2011 at 2:40 AM, gmagog...@gmail.com gmagog...@gmail.comwrote: if( links can be melt and made into smaller links ) { return 1; } else { return 2; } Yanan Cao On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar sourabhjak...@gmail.comwrote: two On

Re: [algogeeks] novel written test

2011-06-27 Thread amit kumar
ok piyush..u r right.well done On Tue, Jun 28, 2011 at 2:31 AM, Piyush Sinha ecstasy.piy...@gmail.comwrote: We just need to look the 3 set of number that multiply to 36... the set can be as (1,1,36),(1,2,18),(1,4,9)..(1,6,6),(1,3,12)..(2,2,9) The catch here is we need not