Yesterday Teddy played a game repeatedly on his computer and won exactly 85% of his games he played. Today, Teddy played the same game repeatedly, winning every game he played, until his over-all winning percentage was exactly 94%. What is the minimum number of the games he played today?
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.
Thanks! I was going to post a similar explanation.
Yesterday:
T y W y = 1 0 0 8 5 ⟹ W y = 2 0 1 7 ⋅ T y ∴ min. T y = 2 0
Today:
T y + W t W y + W t ⟹ 1 0 0 W y + 1 0 0 W t ⟹ 6 W t ⟹ W t ⟹ min. W t = 1 0 0 9 4 = 9 4 T y + 9 4 W t = 9 4 T y − 1 0 0 W y = 9 4 T y − 8 5 T y = 9 T y = 2 3 T y = 3 0 as min. T y = 2 0
Thanks, but your solution is kind of misleading because 20 is boxed, not 30.
Problem Loading...
Note Loading...
Set Loading...
Let N , M games were played by Teddy on first day and second day respectively. Then he won 8 5 % of N games on first day and all of the M games on second day.
Total number of games played = M + N
Total number of games won = 8 5 % of N + M = 2 0 1 7 N + M
Win Percentage of total games = M + N 2 0 1 7 N + M × 1 0 0 %
But net win percentage is given to be 9 4 %
So, M + N 2 0 1 7 N + M × 1 0 0 % = 9 4 %
⇒ 2 0 1 7 N + M = 1 0 0 9 4 M + 1 0 0 9 4 N
⇒ 1 0 0 6 M = 1 0 0 9 N
⇒ 2 M = 3 N
Now, Since RHS is a multiple of 3 ,so M must be a multiple of 3 .
For total number of won games to be an integers we must have
2 0 1 7 N as an integer and 1 0 0 9 4 ( M + N ) as an integer.
⇒ N must be a multiple of 2 0 and M + N must be a multiple of 5 0 .
So least value of M + N possible is 5 0 .
To get least value of M we must have maximum value of N as a multiple of (20) such that M is a multiple of 3 .
Such maximum value of N is 2 0 with M = 3 0 .
Hence minimum number of games played by Teddy on the second day is 3 0 .