A selection of 3 whatsits, 7 doovers and 1 thingy cost a total of $329. A selection of 4 whatsits, 10 doovers and 1 thingy cost $441. What is the total cost, in dollars, of 1 whatsit, 1 doover and 1 thingy?
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.
Isnt it better to multiply 1 by 3 and 2 by 4 and simply subtract them
Log in to reply
But that would give us 3 ( 3 w + 7 d + t ) − 4 ( 4 w + 1 0 d + t ) = − 7 w − 1 9 d − t , which doesn't really help.
My method ends up multiplying (i) by 3 and (ii) by 2 and then subtracting, which does result in w + d + t .
Log in to reply
Yeah,sorry I meant to say the same thing only i just typed wrongly.Iam such a fool
3 w + 7 d + t = 3 2 9 ..........(1)
4 w + 1 0 d + t = 4 4 1 ..........(2)
(2) - (1): w + 3 d = 1 1 2 ..........(3)
(1) - 2*(3): w + d + t = 1 0 5
Problem Loading...
Note Loading...
Set Loading...
Letting w , d , t represent the number of whatsits, doovers and thinghys, respectively, we have that
(i) 3 w + 7 d + t = 3 2 9 and
(ii) 4 w + 1 0 d + t = 4 4 1 .
Now as we have three variables and only two (linearly independent) equations there will be multiple positive integer solutions for ( w , d , t ) . However, this does not rule out the possibility of finding a unique value for w + d + t . To this end, we need to find values a , b such that
a ∗ ( 3 w + 7 d + t ) + b ∗ ( 4 w + 1 0 d + t ) = w + d + t ⟹ ( 3 a + 4 b ) w + ( 7 a + 1 0 b ) d + ( a + b ) t = w + d + t .
Equating like coefficients, we require that 3 a + 4 b = 1 , 7 a + 1 0 b = 1 and a + b = 1 .
Then 3 a + 4 b − 3 ( a + b ) = 1 − 3 = − 2 ⟹ b = − 2 , a = 3 , which also satisfies 7 a + 1 0 b = 1 .
Thus w + d + t = 3 ∗ 3 2 9 − 2 ∗ 4 4 1 = 1 0 5 .
Possible positive integer solutions for ( w , d , t ) include ( 2 2 , 3 0 , 5 3 ) , ( 5 2 , 2 0 , 3 3 ) and ( 8 2 , 1 0 , 1 3 ) . (There are in fact 3 4 such solutions, ranging from ( 1 , 3 7 , 6 7 ) to ( 1 0 0 , 4 , 1 ) .)