By now, you must have seen that little rectangle pop up in the bottom corner of the brilliant problem pages saying "X% of people solved this problem."
Now, assume that the % solvers is determined by ⌊ total views # of solvers ⋅ 1 0 0 ⌋
Where ⌊ x ⌋ denotes the floor function of the greatest integer less than or equal to x)
What is the minimum number of views that a problem can have if the % solvers displayed is 19%.
This is part of the set Trevor's Ten
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.
I understood your solution until you said 5.26N - 5N is greater than or equal to 1. Why is that true? Also, could you explain the latter half of your solution a little more? I couldn't grasp all of it. Thanks.
Log in to reply
I've edited my solution now. Hope you understand it now.
Aim is to solve 100x - 19y = 1 in x = 4 and y = 21, as x/y is nearly 19/100. The method of solving this is by using continued fractions, viz. 100/19 = 5 + 1/{3 + 1/[1 + 1/4}}. Then calculate back after ignoring 1/4 to get 21/4, giving the above mentioned natural numbers y and x. Answer = 21. See my problem "Never seen before" and its solution.
(I forgot to hashtag it so I'm putting it here. Lol) #easymoney
Anyway, here's the solution, it's a little bashy
This is all a game is strategical estimation.
Begin with 1 0 0 1 9
To reduce this, we add ± 1 to the numerator and get 1 0 0 2 0 and 1 0 0 1 8 this increases the value.
Now we have to check cases.
Simplifying and rounding, we will use two techniques. Adding ± 1 to the numerator/denominator and simplifying by dividing through by a common factor. We have to check
5 0 1 0 , 2 5 5 , 2 0 4 and 5 0 9
From the first three, they are too large, so we have to either add one to the denominator or subtract one from the numerator. Visa versa for the second.
( 5 1 1 0 , 2 6 5 , 2 1 4 , 4 9 9 ) , ( 5 0 9 , 2 5 4 , 2 0 3 , 5 0 1 1 )
Using a calculator, we can start working with the smallest denominator (this way we don't have to check them all. After checking the two smallest, 2 1 4 ≈ 1 9 . 0 4 % .
Checking all cases less than this for extra measure.
1 6 3 = 1 8 . 7 5 %
1 5 3 = 2 0 %
1 1 2 = 1 8 . 1 8 %
1 0 2 = 2 0 %
6 1 = 1 6 . 6 7 %
5 1 = 2 0 %
Since 2 1 4 is the smallest that works, our answer is 2 1
Here's my approach:
Denote by s , v the total number of solvers and viewers respectively. We then have,
⌊ v s × 1 0 0 ⌋ = 1 9 ⟹ v 1 0 0 s ∈ [ 1 9 , 2 0 ) ⟹ s ∈ [ 0 . 1 9 v , 0 . 2 0 v )
Now, here's the catch. Since s and v must be positive integers, we need to find the minimum positive integer v such that ∃ s ∈ Z + ∣ s ∈ [ 0 . 1 9 v , 0 . 2 0 v ) .
We find the following pattern, since there is no closed upper bound and only a closed lower bound and there isn't much of a difference between 0 . 1 9 and 0 . 2 0 , for minimum v , we must have,
⌈ 0 . 1 9 v ⌉ = ⌊ 0 . 2 0 v ⌋
A bit more observation lead me to the result that we must have the minimum value of v of the form v = 1 + 5 k for some k ∈ Z .
Now, trial and error gives us the value v m i n = 1 + 5 × 4 = 2 1
Log in to reply
very nice approach. Flipping the ceiling/floor sign, never knew you could do that.
Log in to reply
In general, you can't. It works here because 0 . 1 9 v and 0 . 2 0 v can have an integer between them (for small positive integer n ) iff they satisfy the above equation (floor-ceiling one).
For larger values of n that can be an answer to this problem, the equation (floor-ceiling one) will not hold.
By the way, this is a very nice problem and if I recall correctly, there is a very old problem (almost 1 year old) from the community that is almost identical to this one. But I think there's a slight variation in this one.
Log in to reply
I wasn't even around brilliant 8 months ago
Log in to reply
Lol, I still remember the old version of this one (though not completely). I think it was my first high rated NT problem (or maybe it was Algebra, Idk) that I solved. :D
1 2 3 4 5 6 7 |
|
:)
Problem Loading...
Note Loading...
Set Loading...
This is not a general solution. I pretty much lucked out since you used 1 9 .
Anyways, ⌊ T 1 0 0 N ⌋ = 1 9
⟹ 1 9 ≤ T 1 0 0 N < 2 0
⟹ 1 0 0 1 9 ≤ T N < 1 0 0 2 0
⟹ 1 0 0 N 1 9 ≤ T 1 < 1 0 0 N 2 0
⟹ 1 9 1 0 0 N ≥ T > 2 0 1 0 0 N
⟹ 5 . 2 6 N ≥ T > 5 N
Now suppose that 5 . 2 6 N − 5 N < 1 . That would imply 5 . 2 6 N < 5 N + 1 . Also, since T > 5 N , and since 5 N and T are integers, we have T ≥ 5 N + 1 . Therefore, T ≥ 5 N + 1 > 5 . 2 6 N ⟹ T > 5 . 2 6 N . Which is a contradiction since we have 5 . 2 6 N ≥ T .
Therefore 5 . 2 6 N − 5 N > 1
So, 5 . 2 6 N − 5 N ≥ 1 ⟹ . 2 6 N ≥ 1 ⟹ N ≥ 3 . 8 4 Taking N = 4 , we have
2 1 . 0 4 ≥ T > 2 0 , giving us a solution of T = 2 1