There are 3 boxes. Each box contains 2 envelopes. Each envelope contains cash - two of them contain $ 2 5 0 , 0 0 0 each, two of them contain $ 1 5 0 , 0 0 0 each and remaining two contain $ 1 0 0 , 0 0 0 each. No box holds envelopes with same amount of money.
There is one statement written on the cover of each box.
Box
1
: Both, box
1
and box
2
contain
$
1
0
0
,
0
0
0
each.
Box
2
: Both, box
2
and box
3
contain
$
2
5
0
,
0
0
0
each.
Box
3
: Both, box
3
and box
1
contain
$
1
5
0
,
0
0
0
each.
Only one of the above 3 statements is true and the corresponding box contains the maximum amount. Can you tell which box contains the maximum amount and how much?
Give your answer as the box number plus the amount of money inside the box plus 1 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Oops, back in black for readability sake!
To save some work, I will start off with an educated guess and use the fact that the box with the true statement must contain the largest amount of money. Since 1 0 0 k + 1 5 0 k = 2 5 0 k , a box with 2 5 0 k inside must have the true statement. Furthermore, all boxes include themselves in their statements and thus only if we assume the second boxes' statement to be true, could we save some work. So let's do that.
The boxes' contents can be represented in a table like this:
Box 1 | Box 2 | Box 3 |
1 0 0 k | 1 0 0 k | 1 0 0 k |
1 5 0 k | 1 5 0 k | 1 5 0 k |
2 5 0 k | 2 5 0 k | 2 5 0 k |
If we assume the second box's statement to be true, we immediately find that
Box 1 | Box 2 | Box 3 |
1 0 0 k | 1 0 0 k | 1 0 0 k |
1 5 0 k | 1 5 0 k | 1 5 0 k |
2 5 0 k | 2 5 0 k | 2 5 0 k |
and reversely, for the second box's statement to be true, it must contain the largest amount of money, meaning 2 5 0 k + 1 5 0 k ,
Box 1 | Box 2 | Box 3 |
1 0 0 k | 1 0 0 k | 1 0 0 k |
1 5 0 k | 1 5 0 k | 1 5 0 k |
2 5 0 k | 2 5 0 k | 2 5 0 k |
so that in this case, the only possible configuration becomes
Box 1 | Box 2 | Box 3 |
1 0 0 k | 1 0 0 k | 1 0 0 k |
1 5 0 k | 1 5 0 k | 1 5 0 k |
2 5 0 k | 2 5 0 k | 2 5 0 k |
Cross-checking with the fact that statements one and three must now be wrong, we find that this is the desired configuration and thus the answer is 1 5 0 k + 2 5 0 k + 2 + 1 = 4 0 0 0 0 3 .
Note : if,for example,a statement is saying
both 2 n d and 3 r d have $100000 in them is f a l s e
It means that (either 2 n d box OR 3 r d box) AND 1 s t box(for sure)will have the $100000 envelope .
At work
Since no box holds two envelopes with the same amount of money, the maximum amount of money has to be $ 2 5 0 0 0 0 + $ 1 5 0 0 0 0 = $ 4 0 0 0 0 0 . Meanwhile, there are only three possibilities of the boxes: 1,2 and 3, i.e. three possible answers 4 0 0 0 0 2 , 4 0 0 0 0 3 and 4 0 0 0 0 4 . Since brilliant system allows us 3 chances, by ‘trial and error’ we get the answer 4 0 0 0 0 3 .
But it was not necessary that 400000 was the maximum. So it is not "I am a Genius", it should be "I am lucky"
Log in to reply
Of course it’s necessary :) if you don’t believe me just give a counter example :)
that is genius
Hahaha, I presented the first logic just now but used the second one myself then (2 months ago). It doesn't even matter if we skipped over the reading comprehension and missed the "+1" part, right?
There are 3 boxes. Each box contains 2 envelopes. Each envelope contains cash - two of them contain $ 2 5 0 , 0 0 0 each, two of them contain $ 1 5 0 , 0 0 0 each and remaining two contain $ 1 0 0 , 0 0 0 each. No box holds envelopes with same amount of money.
These statements tell us that the amounts which can be in various boxes are:
$ 1 0 0 , 0 0 0 + $ 1 5 0 , 0 0 0 = $ 2 5 0 , 0 0 0
$ 1 0 0 , 0 0 0 + $ 2 5 0 , 0 0 0 = $ 3 5 0 , 0 0 0
$ 1 5 0 , 0 0 0 + $ 2 5 0 , 0 0 0 = $ 4 0 0 , 0 0 0
We can infer that the box whose statement is true does not contain any envelope containing $ 1 0 0 , 0 0 0 , because the box with the true statement contains the maximum amount and the maximum amount is obtained by $ 1 5 0 , 0 0 0 and $ 2 5 0 , 0 0 0 . If the statement on box 1 is true, then box 1 can have a maximum amount of $ 3 5 0 , 0 0 0 . Therefore, the statement on box 1 isn't true.
If the statement on box 3 is true, to get the maximum amount in the third box, the values will be as in the table:
box 1 | $ 1 5 0 , 0 0 0 + $ 1 0 0 , 0 0 0 |
box 2 | $ 1 0 0 , 0 0 0 + $ 2 5 0 , 0 0 0 |
box 3 | $ 1 5 0 , 0 0 0 + $ 2 5 0 , 0 0 0 |
But this arrangement contradicts the fact that only one statement is true. So the statement on box 2 should be true and we get the arrangement as
box 1 | $ 1 5 0 , 0 0 0 + $ 1 0 0 , 0 0 0 |
box 2 | $ 1 5 0 , 0 0 0 + $ 2 5 0 , 0 0 0 |
box 3 | $ 1 0 0 , 0 0 0 + $ 2 5 0 , 0 0 0 |
Our answer becomes 2 + 4 0 0 0 0 0 + 1 = 4 0 0 0 0 3
Since the maximum amount has to be in the box with the true statement, the latter should assert that it contains the maximum amount. Clearly, any box containing the maximum amount has to contain the amount of 2,50,000 dollars and box 2 asserts that it contains it. So Box 2 is clearly a candidate. Let us check. For it to contain the maximum amount, it should contain an additional amount of 1,50,00 dollars (400,000 in total) while box 3 should contain an additional amount of 100,000 (350,000 in total) . It can be seen that the other statements are false.
We're told that the richest box is the only honest box. Since there's just two copies of each envelope and none of the copies stayed together, each of the box must have different total amount and therefore the richest box may only contain the two distinct top amount of 💰, that is $250k envelope and $150k envelope both for a sum of $400k.
Now that we have cleared that part, moving on to finding the honest box is easy. Honest = richest, so we know that it doesn't have any $100k envelopes inside, therefore one possibility is that this honest box may tell the truth that both other boxes have them ($100k envelopes) inside. After a brief rechecking, Box 1 with mentions of those lowest value envelopes included itself as one of the containers, an obvious lie there and thus, Box 1 is neither honest nor richest, so it must have actually contained that lowest value angpao itself (only honest richest doesn't carry one) and the lie must have lied within the word "both" in "Both, box 1 and box 2...". As of now, we already know that Box 2 doesn't contain the reported envelopes as claimed by the lying Box 1, so Box 2 is our honest richest.
Answer
= 400000 + 2 + 1
= 400003
Since no box holds envelopes with the same amount of money, the boxes will have:
The statements can be re-written as:
1) Box 1: Box 1 and Box 2 contain $100K ⇒ Box 3 doesn't contain $100K ⇒ Box 3 contains $150K and $250K
2) Box 2: Box 2 and Box 3 contain $250K ⇒ Box 1 doesn't contain $250K ⇒ Box 1 contains $100K and $150K
3) Box 3: Box 3 and Box 1 contain $150K ⇒ Box 2 doesn't contain $150K ⇒ Box 2 contains $100K and $250K
Now, if (1) is true, then Box 3 contains $150K + $250K = $400K. But then, this box does not contain the maximum account, and hence, its statement is false.
If (3) is true, then (2) is false, and Box 2 and Box 3 do not contain $250K. But then, Box 3 cannot contain the maximum amount, and this statement is also false.
If (2) is true, then (3) is false, and Box 2 does contain $150K. According to its own statement, it contains $250K as well.
Hence, (2) is true. And Box 2 contains the maximum amount, $400K.
First of all since there are only 2 envelopes of each ( $ 1 0 0 0 0 0 , $ 1 5 0 0 0 0 a n d $ 2 5 0 0 0 0 ) let's simplify the statements written on the box as follows:
Box1 : Box 3 does NOT contain $ 1 0 0 0 0 0
Box2 : Box 1 does NOT contain $ 2 5 0 0 0 0
Box3 : Box 2 does NOT contain $ 1 5 0 0 0 0
The statement on the box with maximum money is true (value of truth!!!)
According to given condition the three boxes have one of the following combination:
Since there are only three combinations and only three boxes, The box with maximum money (and a true statement on it) will have a total of $ 1 5 0 0 0 0 + $ 2 5 0 0 0 0 = $ 4 0 0 0 0 0 . Here note that it cannot contain the envelope with $ 1 0 0 0 0 0 .
Let's assume Statement on Box1 is True . Then it will have the maximum money ( $ 1 5 0 0 0 0 a n d $ 2 5 0 0 0 0 ) However according to the statement written on it, it should have $ 1 0 0 0 0 0 . This is contradictory. Hence our assumption is wrong.
So statement on Box1 is False . As the statement is false, it's simplified version is also False . So Box 3 DOES contain $ 1 0 0 0 0 0 . Hence Box3 cannot contain the maximum amount. As a result the statement on Box3 is also False . As atleast 1 statement needs to be true, S t a t e m e n t o n B o x 2 i s t r u e a n d B o x 2 c o n t a i n s t h e m a x i m u m v a l u e o f $ 4 0 0 0 0 0 .
2 + 4 0 0 0 0 0 + 1 = 4 0 0 0 0 3 is the answer
If box 2 has a right statement, box 3 and box 2 has $ 2 5 0 0 0 0 in it. Since we want to maximize the value of money in box 2 , box 2 must contain $ 2 5 0 0 0 0 and $ 1 5 0 0 0 0 in it. So the answer is 2 5 0 0 0 0 + 1 5 0 0 0 0 + 2 + 1 = 4 0 0 0 0 3 .
I f s t a t e m e n t o f b o x 1 i s t r u e : B o x 1 a n d 2 m u s t h a v e $ 1 0 0 , 0 0 0 S i n c e o n l y $ 1 5 0 , 0 0 0 a n d $ 2 5 0 , 0 0 0 e n v e l o p e a r e l e f t a n d n o b o x h a v e t h e s a m e e n v e l o p e t h e r e f o r e b o x 3 h a v e $ 1 5 0 , 0 0 0 a n d $ 2 5 0 , 0 0 0 e n v e l o p e ∵ b o x 2 m u s t h a v e f a l s e s t a t e m e n t w e w i l l b e c o n s i d e r i n g $ 2 5 0 , 0 0 0 i n i n b o x 1
box | total amount |
1 | $ 3 5 0 , 0 0 0 |
2 | $ 2 5 0 , 0 0 0 |
3 | $ 4 0 0 , 0 0 0 |
⇒ b o x 1 d o e s n ′ t h a v e t h e m a x i m u m a m o u n t ∴ t h e r e i s a c o n t r a d i c t i o n ∴ s t a t e m e n t o n b o x 1 m u s t n o t b e t r u e a s i t l e a d s t o c o n t r a d i c t i o n
I f s t a t e m e n t o f b o x 3 i s t r u e : B o x 3 a n d 1 m u s t h a v e $ 1 5 0 , 0 0 0 S i n c e o n l y $ 1 0 0 , 0 0 0 a n d $ 2 5 0 , 0 0 0 e n v e l o p e a r e l e f t a n d n o b o x h a v e t h e s a m e e n v e l o p e t h e r e f o r e b o x 2 h a v e $ 1 0 0 , 0 0 0 a n d $ 2 5 0 , 0 0 0 e n v e l o p e ∵ b o x 2 m u s t h a v e f a l s e s t a t e m e n t w e w i l l b e c o n s i d e r i n g $ 2 5 0 , 0 0 0 i n i n b o x 1
box | total amount |
1 | $ 4 0 0 , 0 0 0 |
2 | $ 3 5 0 , 0 0 0 |
3 | $ 2 5 0 , 0 0 0 |
⇒ b o x 3 d o e s n ′ t h a v e t h e m a x i m u m a m o u n t ∴ t h e r e i s a c o n t r a d i c t i o n ∴ s t a t e m e n t o n b o x 3 m u s t n o t b e t r u e a s i t l e a d s t o c o n t r a d i c t i o n
I f s t a t e m e n t o f b o x 2 i s t r u e : B o x 3 a n d 2 m u s t h a v e $ 2 5 0 , 0 0 0 S i n c e o n l y $ 1 0 0 , 0 0 0 a n d $ 1 5 0 , 0 0 0 e n v e l o p e a r e l e f t a n d n o b o x h a v e t h e s a m e e n v e l o p e t h e r e f o r e b o x 1 h a v e $ 1 0 0 , 0 0 0 a n d $ 1 5 0 , 0 0 0 e n v e l o p e ∵ b o x 3 m u s t h a v e f a l s e s t a t e m e n t w e w i l l b e c o n s i d e r i n g $ 1 5 0 , 0 0 0 i n i n b o x 2
box | total amount |
1 | $ 2 5 0 , 0 0 0 |
2 | $ 4 0 0 , 0 0 0 |
3 | $ 3 5 0 , 0 0 0 |
∴ s t a t e m e n t o n b o x 2 i s t r u e A n s w e r = 4 0 0 , 0 0 0 + 2 = 4 0 0 0 0 2
I consider the three cases:
Assume that the statement on box 1 is true:
Boxes 1 and 2 each have $100. Box 3 must have $150 and $250 (in order to have two different amounts, and $100 is not available, as both are already used). Box 3 therefore has more than box 1, so this is not the answer.
Assume that the statement on box 3 is true:
In this case, boxes 1 and 3 each have 150. In order to have the most, box 3 must have $250 also. Both of the $150 envelopes are accounted for (in boxes 1 and 3), therefore box 2 must have $100 and $250. That leave one envelope with $100 to go into box 1. In this case, the statement on box 1 is also true (as boxes 1 and 2 each have $100) and that is a contradiction as we are given that only one statement is true, so this is not the answer.
Assume that the statement on box 2 is true:
Boxes 2 and 3 each have $250. Box 2 also has $150 and therefore has the most. Box 1 must have $100 and $150 (because it must have two different amounts, and neither can be $250, becaue both of the $250 envelopes are already used). That means box 3 must have $100. Box 2 has the most, and all of the conditions are satisfied, so box 2 is the correct answer.
Statements | Box 1 | Box 2 | Box 3 |
Box 1 is true | 1, 2.5 | 1, 2.5 | 1.5, 1.5 |
Box 1 is true | 1, 2.5 | 1, 1.5 | 2.5, 1.5 |
Box 2 is true | 1, 1.5 | 2.5, 1.5 | 2.5, 1 |
Box 2 is true | 1.5, 1.5 | 2.5, 1 | 2.5, 1 |
Box 3 is true | 1.5, 1 | 2.5, 2.5 | 1.5, 1 |
Box 3 is true | 1.5, 2.5 | 2.5, 1 | 1.5, 1 |
This table follows the statements and their validity, remember, if a statement isn't true, it's just that only one box contains a given amount and not Both . We're further told that there's no box having the two envelopes in it of same value, now the table becomes,
Statements | Box 1 | Box 2 | Box 3 |
Box 1 is true | 1, 2.5 | 1, 1.5 | 2.5, 1.5 |
Box 2 is true | 1, 1.5 | 2.5, 1.5 | 2.5, 1 |
Box 3 is true | 1.5, 2.5 | 2.5, 1 | 1.5, 1 |
Here we find that only Box 2 can be the one with largest value as only it allows itself to have the largest value when the statement written on it is true.
Thus the answer is 4 0 0 0 0 0 + 2 + 1 = 4 0 0 0 0 3
For the sake of simplicity I am assuming 100000 = 10, 150000 = 15 and 250000 = 25.
The maximum amount possible is 25 + 15 = 40. Then this forces the Box with true statement should be either Box 2 or 3. Since then either Box 2 or 3 immediately receive either 15 or 25.
Suppose if generally some Box X states the true statement. Then the way to find what amount is in what box is very simple. Now since Box X states truth go the statement where in it Box X is not mentioned (like Box 1 is not mentioned in Statement 2) now that this statement is false therefore Box X should contain the amount stated in that statement. Now we know what Box X contains (the amount stated in Statement by X and the statement X is not mentioned), similarly we can find the amounts in other boxes.
Statements/Boxes | Box 1 | Box 2 | Box 3 |
Box 2 states truth | 10,15 | 15,25 | 10,15 |
Box 3 states truth | 15,25 | 10,25 | 10,15 |
Therefore the Box 2 is the required Box and the answer is 2 + 400000 + 1 = 400003
@Percy Jackson hey check this out
Log in to reply
Sorry I didn't check that you changed the question while I was typing the answer
Hey I edited my solution after you changed the question
Hey @Brilliant Mathematics , can you just check if the logic holds valid for this problem? I'm a bit skeptical. Thanks!
Problem Loading...
Note Loading...
Set Loading...