A pharmacy received 15 flasks of a medicine. According with their labels, each flask contained 200 pills, and each pill weighed 20 mg.
Assume that a particular flask came with the same amount of pills but these weighing 30 mg each (and the flask label didn't tell anything about that).
The pharmacy, trying to discover that flask among the others, made some procedures:
Which flask contains the heaviest pills?
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.
Great thought! Thanks for sharing it.
Let the number of 20-mg pills weighed be x , and the number of 30-mg pills weighed be y . The total number of pills weighed is n = 1 ∑ 1 5 n = 2 1 5 ( 1 6 ) = 1 2 0 . We can then form two equations:
x + y = 1 2 0 ⟹ x = 1 2 0 − y ⟹ Eq.(1)
2 0 x + 3 0 y = 2 5 4 0 ⟹ Eq.(2)
Substitute Eq.(1) into Eq.(2):
2 0 ( 1 2 0 − y ) + 3 0 y = 2 5 4 0 2 4 0 0 − 2 0 y + 3 0 y = 2 5 4 0 1 0 y = 1 4 0 y = 1 4
Neat and nice solution!
Problem Loading...
Note Loading...
Set Loading...
Let the number of the flask containing the 30-mg pills be n . We know that the total number of pills weighed is 2 1 5 ( 1 6 ) = 1 2 0 . The weight of these 120 pills is 2540 mg, which means that:
1 2 0 × 2 0 + n ( 3 0 − 2 0 ) 2 4 0 0 + 1 0 n 1 0 n ⟹ n = 2 5 4 0 = 2 5 4 0 = 1 4 0 = 1 4