Juliet has attempted 213 problems on Brilliant and solved 210 of them correctly. Her friend Romeo has just joined Brilliant, and attempted 4 problems and solved 2 correctly. From now on, Juliet and Romeo will attempt all the same new problems. Find the minimum number of problems they must attempt such that it is possible that Romeo's ratio of correct solutions to attempted problems will be strictly greater than Juliet's.
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.
can you explain why you don't add n at 210 ????
Log in to reply
You don't add an n to 2 1 0 because 2 1 0 is the number of questions Juliet has gotten right. The fastest way for Romeo and Juliet to have the same ratio of questions correct to questions attempted is if Juliet gets all future questions wrong (meaning she has solved exactly 2 1 0 questions out of 2 1 3 + n ) and if Romeo gets all future questions right (meaning he will have solved 2 + n questions out of 4 + n ).
What do you mean? At which particular step are you having trouble with?
Log in to reply
The question wasn't clear.I thought that they both get the same number of correct/wrong answers (Unless specified, it would be best to assume both their brains are equally matched). Similar to what Alfredo is asking, in which case the answer would be 414.
Log in to reply
@Vishnu Bhagyanath – It states "such that it is possible that", which means you have control over which problems a person gets right.
IE you are finding the minimum number of problems, such that it is possible in some scenario (given the history of problems solved), for Romeo's ratio to be strictly greater than Juliet's ratio
Log in to reply
@Calvin Lin – You have considered the best possible scenario, that is bit weird.
Log in to reply
@Som Ghosh – It says "Find the minimum number of problems they must attempt such that it is possible ...". That is why we chose the best possible scenario.
@Som Ghosh – If a question said "find the minimum number of problems you must attempt such that it is possible to get 3 correct" surely the answer is 3: attempting 0, 1 or 2 it would not be possible to get three correct but in the "best possible scenario", that you get them all correct, you have to attempt 3. Now you could go about arguing that it's "a bit weird" to consider such a scenario, let's assume you usually only get 50% correct on Brilliant, so then you must attempt 6. But that doesn't change the fact that it is POSSIBLE to get three correct answers with three problems, even if it is unlikely.
@Vishnu Bhagyanath – Answer in that case is 415. And I agree with you . I also thought the same.
For to decrease juliet's ratio we assume that she does not answer the questions correctly
Because you eant the smallest number, so you assume she will get none of them correctly and he gets all right... So you only add 'n' to 213
so for Romio: total of correct questions= 210 totel of attempted questions = 213+ X
for Juliet: total no. of correct questions= 2+X totel of attempted questions = 4+ X given: 2+X / 4+x > 210/(213+ X) after solving..
X^2+ 5X - 414 > 0
(X - 18) (X +23) > 0
as x must be positive so X > 18
Log in to reply
Great! When you answer the problem correctly, you can submit your solution directly :)
There's some kind of logical bias here, which makes it really hard to solve for most people. Can you name it?
Log in to reply
Can you be more explicit about what you think the logical bias is?
Are you referring to
1. Setting up the inequality
2. Figuring out what worst-case scenarios are
Log in to reply
Figuring out what worst-case scenarios are--there can be some conditional probability attested to the solution: assuming Juliet has a brain of her own and she has got 98.59% of brilliants problems correct earlier; you can't know for sure if she'll get those 19 problems--all wrong. (If it's not a bias, problems of this kind are more likely to cause certain hate for problem-solving as it stands up against the real world--that's my personal opinion)
As usual your solution is brilliant and easy to understand.
But my doubt is that in the first line you have written "to attempted". Is it not grammatically incorrect?
I think it should be "to attempt".
Am i right?
Log in to reply
No it is correct. It says the ...ratio of 'correct solutions' to 'attempted questions'...
Log in to reply
Right. The grammar rule that Priyanshu is thinking of is "If the sentence has the format of "To Verb", then the verb should be in present tense".
In this context is that the sentence is "The ratio of (Item A) to (Item B)", where Item A = correct solutions and Item B = attempted solutions.
Another similar example is saying that "I drove to (place X)", where X = bowling lessons (an activity). We do not say "I drove to bowl lessons".
Log in to reply
@Calvin Lin – Oh yes, it's correct. I didn't notice the ratio one.
Python 2.7:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
|
Sledgehammer to crack a nut: programming a brute-force to substitute solving a quadratic equation
Problem Loading...
Note Loading...
Set Loading...
Currently, Romeo's ratio of correct solutions to attempted problems is 4 2 , and Juliet's ratio is 2 1 3 2 1 0 , so Juliet is far ahead. The minimum number of future problems they must both attempt so that Romeo's ratio will be greater than Juliet's occurs when Romeo gets all his solutions correct and Juliet gets none of her solutions correct. If they both attempt n problems and Romeo gets them all correct and Juliet gets none of them correct, then Romeo's ratio becomes 4 + n 2 + n and Juliet's ratio becomes 2 1 3 + n 2 1 0 . Therefore, we would like to find the smallest positive integer n such that 4 + n 2 + n > 2 1 3 + n 2 1 0 .
Multiplying both sides of this inequality by ( 4 + n ) ( 2 1 3 + n ) gives
( 2 + n ) ( 2 1 3 + n ) > ( 2 1 0 ) ( 4 + n ) , or 4 2 6 + 2 1 5 n + n 2 > 8 4 0 + 2 1 0 n .
This simplifies to n 2 + 5 n − 4 1 4 > 0 , and we can factor to obtain ( n − 1 8 ) ( n + 2 3 ) > 0 . Therefore, for 0 ≤ n ≤ 1 8 , Romeo's ratio is less than or equal to Juliet's ratio, but after attempting 1 9 additional problems, it is possible for Romeo's ratio to be higher than Juliet's.