There are 8 billiard balls, and one of them is slightly
heavier, but the only way to tell was by putting it on a
weighing scale against another. What's the fewest number of
times you'd have to use the scale to find the heavier ball?
Answers were Sorted based on User's Feedback
Answer / dilip kumar
2 times should be fine. split the 8 balls into 3, 3 and 2.
Incase the hevier one is in one of the set, place the 3
balls each to weigh and find the heavier pan and pick them
weight two of the three in each pan. incase the two balls
are equal, then the one in hand is heavier.
From case 1. if both the three sets are equal, weight the
other two balls one in each pan and you can find the
heavier one.
Thus 2 times you may have to use the wieghing pan
| Is This Answer Correct ? | 50 Yes | 4 No |
Answer / ganesh
According to the `principle of moments` theory, we have to
weigh 3 times, to find the heavier ball.
| Is This Answer Correct ? | 20 Yes | 20 No |
Answer / deepak
1.in the first attempt we would be able to get the heaviest
ball.
| Is This Answer Correct ? | 5 Yes | 20 No |
a car starting from station A at 8am reaches station B at 12 noon.if another car starting from station B at 9AM reaches station A at 11:30AM,then the two cars will meet each other at
A train 100 meter long takes 3 second to cross a man walking at the rate of 6km/hr in a direction opposite to that of the train. Find the speed of the train.
In the month of march a basketball team played 60 games and won 30% of its game played. After some time the team raised it to 50%. How many games did the team had won to attain this average.
3. (1/10)18 - (1/10)20 = ?
Alice and Bob play the following coins-on-a-stack game. 20 coins are stacked one above the other. One of them is a special (gold) coin and the rest are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack. Alice starts and the players take turns. A turn consists of moving the coin on the top to a position i below the top coin (0 = i = 20). We will call this an i-move (thus a 0- move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2- move, on subsequent turns neither player can make a 2-move. If the gold coin happens to be on top when it's a player's turn then the player wins the game. Initially, the gold coinis the third coin from the top
3. A chicken farmer surveyed his flock with the following results. The farmer Has: 9 fat red roosters(male), 37 fat chickens 6 thin red roosters 2 fat red hens , 7 thin brown hens ,5 thin red hens 26 fat roosters (total) ,18 thin brown roosters Answer the following questions about the flock(HINT: in your Venn diagram make a circle for fat, for male and for red). How many chickens are: a) fat? __________ b) red? ___________ c) male? _________ d) fat, but not male? _________ e) brown, but not fat? ________ e) read and fat? _________
Find the hypotaneous of a right angle isoceles triangle whose area is 50.
In which of the system a) decimal no. 384 is equal to 1234 b)decimal no. 362 is given by (1362)x in the X system of numbers.
A cow is tethered in the middle of a field with a 14 feet long rope. If the cow grazes 100 sq feet per day approximately. What time will be taken by the cow to graze the grazeable area of the field? (a) 2 days (b) 18 days (c) 24 days (d) 6 days (e) None of these
what should be the age of sameer when his best friends age is 22 at the time of his graduation
The size of a program is N. And the memory occupied by the program is given by M = square root of 100N. If the size of the program is increased by 1% then how much memory now occupied?
Total balls z,red balls N remaining are blak balls,then %of black balls equal to