### Discussion :: Logical Problems - Type 1 (Q.No.1)

Each problem consists of three statements. Based on the first two statements, the third statement may be true, false, or uncertain.

Hari said: (Sep 7, 2010) | |

Need more explanation. |

Sundar said: (Sep 13, 2010) | |

Hi Viewers, To solve these kind of problems just make the given data into expressions. Tanya is older than Eric ==> Tanya > EricCliff is older than Tanya ==> Cliff > Tanya > EricEric is older than Cliff : This is wrong, because from the above statement we can easily find that Eric is younger than Cliff and Tanya. Therefore the answer is 'False' (Option B). Hope this will help you. Have a nice day! |

Rahul said: (Dec 28, 2010) | |

It will help to understand if we can get more clarification on these. |

Harjit said: (Jul 9, 2011) | |

Sundar sir your explanation always very good. |

Aishu said: (Sep 28, 2011) | |

All of you came up wit good answers :-) and special thanks to Sundar :-) |

Bindu Yadav said: (Oct 6, 2011) | |

Explation is corrcet. |

Sangram said: (Oct 28, 2011) | |

Sir your explanation is very good. |

Pankaj said: (Jun 8, 2012) | |

Thanks sundar. |

Somnath Bagul said: (Apr 9, 2013) | |

You own a shop of chocolates. You want to give exact number of chocolates (say for orders up to 1000 chocolates) to customers without counting them at the time of giving. You can pre fill chocolates in bags by counting them upfront and give appropriate bags (one or many) to fulfill the order. What is the minimum number of bags will you need to satisfy your first order? (Remember you do not know what is the order upfront). Solve it now I am waiting for results. |

Jahir Hussain said: (Oct 21, 2014) | |

Let us consider. Tanya < Eric == > 10 < 11 Cliff < Tanya == > 9 < 10 Eric < Cliff ==> 11 < 9 It is wrong so false. |

Slazzy said: (Feb 18, 2015) | |

@Somnath. Your question has no base. Kindly please go through it again yourself and see if you have made a mistake or not. |

Nemo said: (Sep 26, 2015) | |

@Somnath. Base 2 (Binary should be able to help you with your problem). Bag 1 = 1 chocolate = 000 000 001. Bag 2 = 2 chocolates = 000 000 010. Bag 3 = 4 chocolates = 000 000 100. Bag 4 = 8 chocolates = 000 001 000. And so on, all the way to: Bag 10 = 512 chocolates = 100 000 000. Assuming that a 1000 chocolates are requested by the first customer, you will use bags 10, 9, 8, 7, 6, and 4; i.e 1. 512 + 256 + 128 + 64 + 32 + 8 = 1000. So the answer is 10 bags. This problem is easy as only addition (Sum of chocolates) is involved. Here is a harder question, how many pieces should a grocer break his 10 Kg weight piece into, if he wishes to be able to measure weights from 100 gm to 10 Kg at intervals of 100 gm? i.e 100 gm, 200 gm, 300 gm, . All the way too 9.9 kg, 10 kg. |

Angelena said: (Dec 1, 2015) | |

Very helpful for the coat so much logical work helps you get in to gifted program. |

Sasi said: (Dec 6, 2015) | |

Yup it's false because if I am older than brother and my sister is older than me then then of course. My brother is older than sister is false. |

Suresh Jp said: (Mar 15, 2016) | |

T > E. C > T. E > C . E < T & C, So answer is FALSE. |

Shekharrao said: (May 5, 2016) | |

Well explained @Suresh. |

Smita said: (Aug 4, 2016) | |

Good explanation. Thanks to all. |

Shashwath said: (Aug 23, 2016) | |

Hi, everyone ,nice to see you all. Good explanation. Thanks to all and Special Thanks, @Sundar. But even will give you an example. My name is Shashwath. My younger name is Abhi. My elder name is Ramunjun. So, Abhi > Shashwath > Ramunjun. So we can say it in that way also. If you understand you can do all sums like this! |

Shweta said: (Apr 1, 2017) | |

@Nemo. Why you have taken base 2? One can take any base? |

C P Thiru Vikram said: (Jun 15, 2017) | |

Good explanation. Thanks to all. |

Sahitya said: (Jun 27, 2017) | |

Good explanation, Thanks, @Sundar. |

Tarun said: (Apr 28, 2018) | |

Thanks for the answer @Sundar. |

Christiana said: (Sep 2, 2018) | |

Thanks all. |

Deepthi said: (Sep 29, 2018) | |

Good explanation, thanks @Sundar. |

#### Post your comments here:

Name *:

Email : (optional)

» Your comments will be displayed only after manual approval.