Below, we present a problem from the 1/28 Algebra and Number Theory set, along with 3 student submitted solution. You may vote up for the solutions that you think should be featured, and should vote down for those solutions that you think are wrong (voting is anonymous!). Also, feel free to make remarks about these solutions, especially since threading of comments has been introduced :).
Minimum Digit Sum Fraction Let denote the digit sum of the integer . As ranges over all 3-digit positive numbers, what value of would give the minimum of ?
You may try the problem by clicking on the above link.
All solutions may have LaTeX edits to make the math appear properly. The exposition is presented as is, and has not been edited.
Solution A - This has been edited to "Edited Solution A". Please note that the phrase " is more dominant on the numerator than on the denominator" has been removed, is it's not a valid reasoning for why we want to minimize A. This logic is flawed, in part since we want to ended up maximizing B, which is also 'more dominant on the numerator'. This was used in several solutions, which were marked wrong.
Edited Solution A - This is much clearer about how to proceed. The main idea being that in dealing with a rational function, it's easier to minimize / maximize it when the variable only appears in the numerator or denominator. There are several ways that work, and we simply used long division. There are several ways we could have proceeded. A slightly more straightforward way, is to repeat the same analysis with to obtain , where it's obvious that we would want . Working with is slightly trickier, , the numerator is always positive since , hence we want to maximize . [For those who have learnt calculus, this is essentially partial differentiation.]
Solution B - This solution makes no sense at all. I am unable to find any information on the 'batting average lemma', though I can guess what it should mean. However, the way it is stated, it's quite clearly false, like the counter example but . I am guessing that he intended it to be , which is true for . If you want to state a theorem, make sure that the statement is correct, and that the proper conditions are given.
Solution C - This was the most common error made, arguing that the numerator must be minimum (which occurs when ) and that the denominator must be maximum (which occurs when ). This statement is false, as the is great dependence between the numerator and denominator. The rest of the solution devolves into case checking. It is far better to have simply done a solution through case checking, and being thorough in explaining "the pattern ... increase the numerator by 10, the fraction keeps decreasing", which can be shown using Edited Solution A.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Solution A - This is a 3-digit number, so we can call the digits A B C, where A=0. This means: N=100A+10B+C and S=A+B+C. So, by the definition of M, we have: M=A+B+C100A+10B+C Remark that this can be re-written as M=A+B+C99A+9B+1 We want to minimize this, so we want C=9. Substituting this into the equation above, we obtain: M=A+B+999A+9B+1=A+B+9(90A−81)(9A+9B+81)+1 =A+B+990A−81+9+1=A+B+990A−81+10 Again, we wish to minimize this so, clearly, B=9. Substituting B=9 into this, we get: M=A+1890A−81+10. Now, haste makes waste! We cannot just conclude that A=9 as well. In fact, it's quite clear that 999 isn't the best we can do. Note that, unlike B and C, A is more dominant on the numerator than on the denominator. We do not have to long-divide to see this. In fact, I am skipping that detail completely in my solution because it's seen quite easily. So, to minimize the expression, we need to minimize A, thus, it needs to be 1. We got: A = 1, B = 9, C = 9, so the answer is 199.
Log in to reply
Oh, this is my solution! Calculus isn't required. I actually realized, right after I clicked "Submit Solution" that I could have made the A-minimization a little clearer. But I guess it looks clear! Thanks to those who voted for this. Currently leading. :D
Log in to reply
Actually, the entire thing could be made a lot clearer. Can you email me an updated version?
Log in to reply
Log in to reply
Log in to reply
Edited Solution A - This is a 3-digit number, so we can call the digits A B C, where A=0. This means: N=100A+10B+C and S=A+B+C. So, by the definition of M, we have: M=A+B+C100A+10B+C
Remark that this can be re-written as M=A+B+C99A+9B+1. Consider this as a function of C and notice that C only appears in the denominator. We want to minimize this, so we want to maximize C; i.e. C=9. [Note: It doesn't matter what positive values A and B are. - Calvin]
Substituting this into the equation above, we obtain: M=A+B+999A+9B+1=A+B+9(90A−81)(9A+9B+81)+1. Now, M can be rewritten as M=A+B+990A−81+9+1=A+B+990A−81+10. Again, we wish to minimize this so, in the same manner, we note that B only appears in the denominator in this function of B. Clearly, we want to maximize B to minimize this fraction. So, B=9.
Substituting B=9 into this, we get: M=A+1890A−81+10. Now, haste makes waste! We cannot just conclude that A=9 as well. In fact, it's quite clear that 999 isn't the best we can do. Note that M=A+1890A−81+10=A+1890A+90×18−90×18−81+10=90−A+1890×18+81+10. Aha! We want to minimize this expression, so we want to maximize A+181. And, to do this, we need to minimize A, since A is in the denominator. This is reverse logic from what we did with B and C. Since A can't be 0 (if it was, we wouldn't have a 3-digit number), A must be 1.
So, we got: A = 1, B = 9, C = 9, so the answer is 199.
Log in to reply
calvin u r really a mathematics-charmer!!!HATS OFF FOR ENDLESS EFFORT FOR CLARIFYING .......
Thank you for posting the new updated solution! So the number of votes would be the number of votes for the previous one + this one?
Log in to reply
I don't think so, since the voters of the previous solution may vote up for this too.
But I think it is the one which will be featured.
How is $/frac{99A + B}{A+B+9} +1 = /frac{(90A-81)(9A+B + 81)}{A+B+9} + 1$ happen?
[Solution edited out - Calvin]
[James suggested a problem, which I might use in an upcoming set - Calvin]
Log in to reply
THat's an interesting question. Would you like to send your solution to me? I'd like to use it as an upcoming problem.
Log in to reply
Oh, I have a somewhat ugly solution; I was looking to see if anyone had a good solution to it also.
No simple solution. :(
Log in to reply
The solution is actually really simple and direct, based off knowing the graph of X1.
Log in to reply
Which solution?
Log in to reply
It is a very simple one. It is very obvious that to make the fraction smallest, we will have to make the number's hundredth digit small i.e. 1. Now, it is again very obvious that its units digit should be 9 so that the fraction becomes small (as denominator will increase same as numerator). Now, we wish to maximize the denominator and so the tenths digit must be 9. So 199 is the answer.
Log in to reply
Solutions like yours have been marked wrong. You offer no explanation of why the value will be minimized, since the numerator and denominator both change. See Solution C.
Log in to reply
I have an explanation. It is really very good but it will take a lot of formatting to show it here. Please send me your email id so that I can mail a document which has the explanation. Please give me a chance to explain my answer. Please sir.
Log in to reply
Log in to reply
Remarks Added.
CANT GET B ! C IS JUST USELESS and A IS QUITE CORRECT AND SHORT
Solution B - Letting our three digit number def be such that def=100a+10b+c, we see that M=a+b+c100a+10b+c. The batting average lemma states that if ba≤dc then c+da+b≤dc. So now we start with n=100 and consider what happens if we add, batting average style, to each digits place: we add a fraction of value corresponding to the value of the place. So, and this is not fully rigorous but it does suffice after a little numerical testing at the extreme ranges to see if the pattern holds, we see that increasing b and c decreases the value of M but that increasing a does not. So we let b and c be 9 and a be 1 and our answer is that the minimum value of M occurs at n=199
Solution C - Here, the numerator (N) of the fraction should be minimum and denominator (S(N)) should be maximum. Hence, the numerator must be in 100's and denominator should be an addition of the digits of max. magnitude (i.e, 9). Summing up, we get, Numerator can be 109, 119,... and Denominator can be (1+0+9), (1+1+9),... respectively. By trial and error, 109/(1+0+9)= 10.9; 119/(1+1+9)= 10.81; and so on.... Hence, observing the pattern we see that as we increase the numerator by 10, the fraction keeps decreasing. Hence at 199/(1+9+9)= 10.47, the fraction should be minimum. For further verifying it, we take 299/(2+9+9)= 14.95; 399/(3+9+9)= 19; and so the value of the fraction keeps increasing as we increase the numerator. Hence, we conclude that the fraction "M" has minimum value when N=199.
Log in to reply
post each and every solution.They are good