Easy one ........... A person came to general stores and bought some articles of Rs.200 and paid the shopkeeper Rs.1000 note. The shopkeeper had no change so got 1000 rs changes from another shop and gave the person 800. Aftr sometime another shopkeeper came and told him that the note was fake and got his money back from him. The shopkeeper lost ? if he sells articles at 0 profit.
A book contains 30 stories.Each story has a different number of pages under 31.First story starts on page 1 and each story starts on a new page.What is the maximum number of stories that can begin on an odd page number?
there are 2 stations A and B. Distance between them is 100 km. speed of train is 1 km/hr. A mosquito flies towards train from station B immediately when the train starts from station A towards B. mosquito reverse its direction immediately after reaching to train and start flying to station B without taking any time. After reaching B, mosquito again reverse its direction immediately and start flying towards train. mosquito repeatedly do this process until train reaches station B. if the speed of mosquito is 2 km/hr how much distance is covered by mosquito during this process.
short trick for finding n (cube root) when m(cube of n i.e n^3=m) is given where n is an integer less than 100. This is useful while finding side of a cube when its volume is given which is a perfect cube
# example I -
lets take 185193
we already somehow know that it is a cube of an integer. or given in question.
now make pair of 3 from back wards i.e. 185, 193
now we have to find two digits only as cube root of six digit no. cant be greater than 99
1st digit comes by taking cube of a no. less than 185 i.e 125 which is cube of 5. so our first digit is 5
now 2 nd digit comes from the unique property which states that last digit of cube of 1 to 9 is different.
0^3=0......#last digit 0
1^3=1......#last digit 1
2^3=8......#last digit 8
3^3=27....#last digit 7
4^3=64....#last digit 4
5^3=125..#last digit 5
6^3=216..#last digit 6
7^3=343..#last digit 3
8^3=512..#last digit 2
9^3=729..#last digit 9
so our 2nd pair(193) last digit is 3 which can come only by cube of any no. ending with 7 (as given earlier that no. is a perfect cube). so our 2nd digit is 7. hence our no. is 57
# example II - now take 571787. pairs are 571, 787
8 cube =512 less than 571 so 8 our 1st digit
last digit of 2nd pair =7 which can come from only cube of 3 so 2nd digit is 3
I have kept a diary of some important problems that involves some out of the box thinking and i'm glad to say that most of those problems have been taken from this thread 👏 😃 🎂. This thread has not only helped me but also the many aspirants as well. I believe that this thread will be closed after the completion of XAT 2014😟. I also hope that no one has to come back to this thread next year 👍 you know what i mean 👼. Bid adieu official quants thread cat 2013.🍻🍻
P.S. I have done with my quants prep for XAT, will not be needing this thread anymore
20 identical boxes are there each having 4 balls. all balls are identical in shape and size and color. 19 of boxes have 1 kg balls . 1 of the unknown box have 2 kg balls. you are given a electronic weight measuring machine. Device a strategy in which you can tell that box having 2 kg balls by using weighing machine 2 times only
A question paper has 4 sections, each consisting of 4 questions. A candidate has to attempt 8 questions taking at least 1 and at most 3 from each section. In how many ways can he select the 8 questions?
A candidate is required to answer 7 qs out of 12,which are divided into 2 groups,each containing 6 qs.He is not permitted to attempt more than 5 from either group.In how many different ways can he choose 7 qs?
A hacker is trying to steal highly confidential information from the Department of Defense system that uses a nine – step security process. Security at each level of the system can be bypassed by entering a numeric sequence whose sum is equal to the number of that security level. A traitor has informed the hacker that the desired numeric sequence only consisted of digits 1 or 2 and security levels are numbered 1 to 9. The numeric sequence to each level is unique. What is the maximum possible number of attempts that will take for the hacker to break the security of all the levels?