A quiz website Brilliante uses a scoring method to calculate how many percents of people are answering a question correctly, as an example, if a question is answered by 3 people and only one of them getting correct, then this website will show "33% of people getting this correct! ". Now, there is a more popular question which has b people answered that and a of them getting it correct, note that a and b are coprime integers. The system renders the message with ratio 33%. What is the minimum value of b ?
Assume that the system rounds the percentage to the nearest integer percent, it rounds 47.5% to 48%, but it rounds 91.2% to 91%.
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.
Nice solution!
Log in to reply
Thanks! Idea from brilliant scoring method, but don't know is it exactly.
Log in to reply
Yes the idea of this problem is brilliant indeed and I don't see flaws in your solution.
Thanks, but I mean I don't know is Brilliant actually using this method, haha!
Hey, 0 . 3 3 4 9 7 5 = 0 . 3 3 4 9 8 = 0 . 3 3 5 = 0 . 3 4 ?
We consider two cases by looking at the continued fractions of x = b a :
In the first case: 6 7 2 0 0 < x − 1 < 3 6 7 6 6 < x − 1 − 2 < 1 1 < ( x − 1 − 2 ) − 1 < 6 6 6 7 0 < ( x − 1 − 2 ) − 1 − 1 < 6 6 1 6 6 < ( ( x − 1 − 2 ) − 1 − 1 ) − 1 This last step of the algorithm is the first one that admits an integer solution, and the smallest such solution is 6 7 , so we solve ( ( x − 1 − 2 ) − 1 − 1 ) − 1 = 6 7 ⟹ x = 2 0 3 6 8
In the second case: 3 < x − 1 ≤ 1 3 4 0 0 < x − 1 − 3 ≤ 1 3 1 1 3 ≤ ( x − 1 − 3 ) − 1 Again, this last step admits an integer solution, and the smallest such solution is 1 3 , so we solve ( x − 1 − 3 ) − 1 = 1 3 ⟹ x = 4 0 1 3 .
Between the two of these, the smallest denominator is 4 0 .
As a sidenote, I believe this process actually minimizes a + b , not b , but since a ≈ 0 . 3 3 b and the values we found for b are relatively small, there's a pretty good argument for why minimizing a + b will be the same as b in this case.
That said, I really don't know when, if ever, it would fail.
Problem Loading...
Note Loading...
Set Loading...
Note that whatever is the value of a , we could find a value of b = 3 a which makes the ratio rendered as 33% (although b=3a violate the coprime rule, it is a good starting point.)
Because of g cd ( a , 3 a ± 1 ) = 1 , we want to find as minimum as possible that 3 a ± 1 satisfy the condition, now let me declare this first inequality: 0 . 3 2 5 ≤ b a < 0 . 3 3 5
If b = 3 a − 1 , then b a = 3 a − 1 a > 3 a a > 0 . 3 2 5 , so it is only necessary to check the upper bound: 3 a − 1 a 2 0 0 a a < 0 . 3 3 5 = 2 0 0 6 7 < 2 0 1 a − 6 7 > 6 7 So at this case the minimum value of a will be 6 8 , then b = 2 0 3 , b a = 0 . 3 3 4 9 7 5 . . . ≈ 0 . 3 3 .
Else if b = 3 a + 1 , then b a = 3 a + 1 a < 3 a a < 0 . 3 3 5 , so we only need to check bottom bound: 3 a + 1 a 4 0 a a ≥ 0 . 3 2 5 = 4 0 1 3 ≥ 3 9 a + 1 3 ≥ 1 3 at this point, the minimum of a will be 1 3 and b is 4 0 , which is far lesser then previous value 2 0 3 . we have 4 0 1 3 = 0 . 3 2 5 ≈ 0 . 3 3 which fullfil our purpose.