This post originally appeared on the Brilliant blog on 12/17/2012.
Below, we present a problem form the 12/10/2012 Algebra and Number Theory set, along with 3 student submitted solutions (none of them have been edited). In the comments section, please vote for the correct solution that you think should be featured, and state your reason for choosing the particular solution. For example "Solution C. Because it made sense." Think also if the solutions are correct, wrong, or missing steps.
All solutions have LaTeX edits to make the math appear properly. These exposition is presented as is, and have not been edited.
Note: I will not reveal who wrote which solution in this blog post. The chosen featured solution will (as always) be credited to the originator.
Solution A
Lemma: The number of digits in an integer x is ceiling(logx), where the base is 10.
Proof: We can find such that . has a followed by n zeros which makes it have digits. has a 1 followed by n+1 zeros which makes it have digits. Take the log base of the inequality to get that: . If the inequality is strict, then taking the log will give an integer in which case, just add one (as shown above). If the inequality is not strict, then the integer x will have the same number of digits as . Taking the log will give a number between n and n+1, in which case you must take the ceiling of the number to get the desired n+1 digits. Going back to the problem, . Since it is slightly bigger than , the number contains digits.
Let be . .Since , so , so , thus has digits.
Solution C
All logarithms are in base . Let , i.e., digits.
Solution A establishes the lemma, which everyone used to approach this problem. This is something that is useful to know, and is used extremely often in computer science. However, the rest of the proof is incomplete, because he only establishes that , which doesn't tell us anything about the integer part of . Had I given that , he would have concluded that the answer is 348. A similar common mistake that is often made by students, is to show that , and then conclude that the minimum value of must be 2 (and no other value).
Solution B by Jianzhi W. managed to establish both bounds. By using , he showed that so and so . Both of these ways are equivalent, but (I feel) that most students (esp computer geeks) will know what is as opposed to . This is the ONLY correct solution out of all student submissions.
Solution C is incorrect, because it uses an unsubstantiated / unfounded 'fact'. There was another 'solution' which said "Google says that has 350 digits". These do not constitute a proof, unless we are intimately familiar with the actual workings, and are confident that the error terms carried over do not exceed the degree of accuracy that we need.
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