Difference between revisions of "1968 IMO Problems/Problem 2"
(→Solution 2) |
|||
(7 intermediate revisions by 4 users not shown) | |||
Line 2: | Line 2: | ||
Find all natural numbers <math>x</math> such that the product of their digits (in decimal notation) is equal to <math>x^2 - 10x - 22</math>. | Find all natural numbers <math>x</math> such that the product of their digits (in decimal notation) is equal to <math>x^2 - 10x - 22</math>. | ||
+ | |||
+ | ==Video Solution (in Chinese) == | ||
+ | |||
+ | https://youtu.be/M2OfNZcUgSI | ||
==Solution 1== | ==Solution 1== | ||
Line 7: | Line 11: | ||
Let the decimal expansion of <math>x</math> be <math>\overline{d_1d_2d_3\dots d_n}</math>, where <math>d_i</math> are base-10 digits. We then have that <math>x\geq d_1\cdot 10^{n-1}</math>. However, the product of the digits of <math>x</math> is <math>d_1d_2d_3\dots d_n\leq d_1\cdot 10\cdot 10\dots 10=d_1\cdot 10^{n-1}</math>, with equality only when <math>x</math> is a one-digit integer. Therefore the product of the digits of <math>x</math> is always at most <math>x</math>, with equality only when <math>x</math> is a base-10 digit. This implies that <math>x^2-10x-22\leq x</math>, so <math>x^2-11x-22\leq 0</math>. Every natural number from 1 to 12 satisfies this inequality, so we only need to check these possibilities. It is easy to rule out 1 through 11, since <math>x^2-10x-22<0</math> for those values. However, <math>12^2-10\cdot 12-22=2</math>, which is the product of the digits of 12. Therefore <math>\boxed{12}</math> is the only natural number with the desired properties. <math>\blacksquare</math> | Let the decimal expansion of <math>x</math> be <math>\overline{d_1d_2d_3\dots d_n}</math>, where <math>d_i</math> are base-10 digits. We then have that <math>x\geq d_1\cdot 10^{n-1}</math>. However, the product of the digits of <math>x</math> is <math>d_1d_2d_3\dots d_n\leq d_1\cdot 10\cdot 10\dots 10=d_1\cdot 10^{n-1}</math>, with equality only when <math>x</math> is a one-digit integer. Therefore the product of the digits of <math>x</math> is always at most <math>x</math>, with equality only when <math>x</math> is a base-10 digit. This implies that <math>x^2-10x-22\leq x</math>, so <math>x^2-11x-22\leq 0</math>. Every natural number from 1 to 12 satisfies this inequality, so we only need to check these possibilities. It is easy to rule out 1 through 11, since <math>x^2-10x-22<0</math> for those values. However, <math>12^2-10\cdot 12-22=2</math>, which is the product of the digits of 12. Therefore <math>\boxed{12}</math> is the only natural number with the desired properties. <math>\blacksquare</math> | ||
− | ==Solution 2== | + | ==Solution 2(SFFT)== |
+ | It is pretty obvious that <math>x</math> cannot be three digits or more, because then <math>x^2 - 10x - 22</math> is way too big. | ||
+ | |||
+ | Write <math>x = 10a + b</math> where <math>a</math> and <math>b</math> are digits satisfying <math>0 \leq a, b < 10</math>. Then, we can use SFFT: | ||
+ | <cmath>(10a + b)^2 - 10(10a + b) - 22 = ab</cmath> | ||
+ | <cmath>(10a + b)^2 - 10(10a + b) - 24 = ab - 2</cmath> | ||
+ | <cmath>(10a + b + 2)(10a + b - 12) = ab - 2.</cmath> | ||
+ | We have | ||
+ | <cmath>(10a + b + 2)(10a + b - 12) \geq (10a + 2)(10a - 12) = 100a^2 - 100a + 24 = 100(a^2 - a) + 24.</cmath> | ||
+ | It is therefore clear that <math>a</math> must be either <math>0</math> or <math>1</math>. We can then split into two cases: | ||
+ | |||
+ | <math>\mathbf{a = 0:}</math> | ||
+ | |||
+ | We have <math>(b + 2)(b - 12) = -2</math> or <math>b^2 - 10b - 22 = 0</math>, which is only satisfied when <math>b = -2</math> or <math>12</math>. | ||
+ | |||
+ | <math>\mathbf{a = 1:}</math> | ||
+ | |||
+ | We have <math>(b + 12)(b - 2) = b - 2</math>. This is only satisfied when <math>b = 2</math>, or <math>b + 12 = 0</math>. Therefore, <math>b = 2</math>, and so <math>x = \boxed{12}.\square</math> | ||
+ | |||
+ | ~mathboy100 | ||
+ | |||
+ | ==Solution 3== | ||
Line 31: | Line 56: | ||
<math>\implies x=12</math> | <math>\implies x=12</math> | ||
− | < | + | <math> \blacksquare</math> |
+ | |||
+ | |||
+ | ==Remarks (added by pf02, August 2024)== | ||
+ | |||
+ | Solutions 2 and 3 are not satisfactory. In fact, they can | ||
+ | not be called solutions, since they make statements which | ||
+ | are not proven. Specifically: | ||
+ | |||
+ | In Solution 2, the author writes "It is pretty obvious that <math>x</math> | ||
+ | cannot be three digits or more, because then <math>x^2 - 10x - 22</math> is | ||
+ | way too big." This is intuitively true, but not obvious at all. | ||
+ | As a crucial step in the solution, it should be proven. Later, | ||
+ | the author states | ||
+ | |||
+ | "<math>(10a + b + 2)(10a + b - 12) \ge \cdots = 100(a^2 - a) + 24</math>. | ||
+ | It is therefore clear that <math>a</math> must be either <math>0</math> or <math>1</math>". | ||
+ | |||
+ | First, the last term should be <math>-24</math> instead of <math>24</math>. Either | ||
+ | way, the conclusion about <math>a</math> is not clear at all. As a second | ||
+ | crucial step in the solution, it should be proven. | ||
+ | |||
+ | In Solution 3, the notation and writing are very confusing. | ||
+ | However, a diligent reader can make sense of them. But in | ||
+ | this solution as well, there are statements which beg for | ||
+ | a proof. The first such statement is | ||
+ | |||
+ | "<math>a^2 \not\equiv 2\ (mod\ 3), a^2 \not\equiv 2\ (mod\ 5), | ||
+ | a^2 \not\equiv 5\ (mod\ 7)</math> which means <math>3, 5, 7</math> don't | ||
+ | divide <math>(x - 5)^2 - 47 = y</math>". | ||
+ | |||
+ | (When writing <math>a^2</math> the author means the square of an | ||
+ | arbitrary natural number, not the square of the number<math>a</math> | ||
+ | used in the line above this statement.) Neither the modulo | ||
+ | statements, nor the conclusion are obvious; proofs should | ||
+ | be given. The second unproven statement is | ||
+ | |||
+ | "<math>2^a + 47 = (x - 5)^2</math>. It is easy to see that <math>a</math> has one | ||
+ | solution and that is <math>2</math>. (Prove it by contradiction.)" | ||
+ | |||
+ | (The author means "the equation has a unique solution for <math>a</math>".) | ||
+ | The conclusion about the uniqueness of <math>a</math> is not easy to see, | ||
+ | and as a crucial step in the solution, it should be proven. | ||
+ | |||
+ | Below, I will give corrected, complete, and somewhat simplified | ||
+ | versions of these two solutions. | ||
+ | |||
+ | |||
+ | ==Solution 2 (corrected and complete)== | ||
+ | |||
+ | Let the decimal expansion of <math>x</math> be <math>\overline{d_1d_2d_3\dots d_n}</math>, | ||
+ | where <math>d_i</math> are base-10 digits. Let us prove first that <math>n \le 2</math>. | ||
+ | |||
+ | Using <math>x^2 - 10x -22 = (x - 5)^2 - 47</math> and the fact that this expression | ||
+ | equals the product <math>d_1d_2d_3 \dots d_n</math> we have that <math>(x - 5)^2 - 47 \le 9^n</math>. | ||
+ | Since <math>x</math> has <math>n</math> digits, we also have | ||
+ | <math>(x - 5)^2 - 47 \ge (10^{n - 1} - 5)^2 - 47</math>. Thus, we have | ||
+ | <math>9^n \ge (10^{n - 1} - 5)^2 - 47</math>. We will show that this can not be true | ||
+ | for <math>n \ge 3</math>. | ||
+ | |||
+ | Divide by <math>9^{n - 1}</math>, rearrange factors and terms, and get | ||
+ | <math>\left[\left(\frac{10}{3}\right)^{n - 1} - \frac{5}{3^{n - 1}}\right]^2 \le | ||
+ | 9 + \frac{47}{9^{n - 1}} < 10</math>. Again using <math>n \ge 3</math>, we get | ||
+ | <math>\left(\frac{10}{3}\right)^{n - 1} < \sqrt{10} + \frac{5}{3^{n - 1}} < 5</math>. | ||
+ | This is false for <math>n \ge 3</math>, so <math>n =</math> the number of digits of <math>x</math> can not | ||
+ | be more than <math>2</math>. | ||
+ | |||
+ | Let then <math>x = 10a + b</math>, with <math>0 \le a, b \le 9</math> the digits of <math>x</math>. We have | ||
+ | <math>x^2 - 10x - 22 = ab \le 81</math>. By solving the quadratic equation | ||
+ | <math>x^2 - 10x - 103 = 0</math> we see that the inequality is true when <math>0 \le x \le 16</math>. | ||
+ | |||
+ | At this point, we could simply check which of the numbers <math>x = 0, 1, \dots, 16</math> | ||
+ | has the product of its digits equal to <math>x^2 - 10x -22</math>. It would turn out that | ||
+ | <math>x = 12</math> is the only one. But we can take a short cut by writing | ||
+ | <math>(10a + b)^2 - 10(10a + b) - 22 = ab</math>. and using that <math>a = 0</math> or <math>a = 1</math>. | ||
+ | In the case <math>a = 0</math> we get the equation <math>b^2 - 10b - 22 = 0</math> in <math>b</math> | ||
+ | which has no integer solutions. In the case <math>a = 1</math> we get the equation | ||
+ | <math>b^2 + 9b - 22 = 0</math> in <math>b</math>, which has solutions <math>-11</math> and <math>2</math>. Since <math>b</math> | ||
+ | is a digit, <math>b = 2</math> is the only acceptable solution, so <math>x = 12</math>. | ||
+ | |||
+ | |||
+ | ==Solution 3 (corrected and complete)== | ||
+ | |||
+ | Let <math>y = x^2 - 10x - 22</math>. Since <math>y</math> is a product of digits, the only | ||
+ | prime factors of <math>y</math> can be <math>2, 3, 5, 7</math>. Write <math>y = (x - 5)^2 - 47</math>. | ||
+ | |||
+ | Note that if <math>A</math> is a natural number then <math>A^2 \equiv 0</math> or <math>1\ (mod\ 3)</math>. | ||
+ | Indeed, <math>A = 3k</math> or <math>A = 3k + 1</math> or <math>A = 3k + 2</math> for some <math>k</math>. By writing | ||
+ | out <math>A^2</math> the statement follows immediately. Then | ||
+ | <math>(x - 5)^2 - 47 \equiv 1</math> or <math>2\ (mod\ 3)</math>, so <math>3</math> can not be a factor of <math>y</math>. | ||
+ | |||
+ | Similarly, if <math>A</math> is a natural number then <math>A^2 \equiv 0, 1</math> or <math>4\ (mod\ 5)</math>. | ||
+ | Then <math>(x - 5)^2 - 47 \equiv 3, 4</math> or <math>2\ (mod\ 5)</math>, so <math>5</math> can not be a factor | ||
+ | of <math>y</math>. | ||
+ | |||
+ | And finally if <math>A</math> is a natural number then | ||
+ | <math>A^2 \equiv 0, 1, 2</math> or <math>4\ (mod\ 7)</math>. | ||
+ | Then <math>(x - 5)^2 - 47 \equiv 2, 3, 4</math> or <math>6\ (mod\ 7)</math>, so <math>7</math> can not be a | ||
+ | factor of <math>y</math>. | ||
+ | |||
+ | The only possible prime factor of <math>y</math> is <math>2</math>. So <math>2^z = (x - 5)^2 - 47</math> | ||
+ | for some <math>z \ge 0</math>. Write this as <math>2^z -2 = (x - 5)^2 - 49</math>, or | ||
+ | <math>2(2^{z - 1} - 1) = (x - 12)(x + 2)</math>. | ||
+ | |||
+ | Clearly <math>z = 0</math> is not acceptable because the equation in <math>x</math> has no | ||
+ | integer solutions. | ||
+ | |||
+ | If <math>z > 1</math> the left hand side is divisible by <math>2</math>, but not by <math>4</math>. The right | ||
+ | hand side is not divisible by <math>2</math> if <math>x</math> is odd, and is divisible by <math>4</math> if | ||
+ | <math>x</math> is even. So <math>z > 1</math> yields no solutions. | ||
+ | |||
+ | If <math>z = 1</math>, the equation becomes <math>x^2 - 10x - 24 = 0</math> which has solutions | ||
+ | <math>-2, 12</math>. The only acceptable solution is <math>x = 12</math>. | ||
+ | |||
==See Also== | ==See Also== | ||
{{IMO box|year=1968|num-b=1|num-a=3}} | {{IMO box|year=1968|num-b=1|num-a=3}} | ||
− | |||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] |
Latest revision as of 18:26, 15 November 2024
Contents
Problem
Find all natural numbers such that the product of their digits (in decimal notation) is equal to .
Video Solution (in Chinese)
Solution 1
Let the decimal expansion of be , where are base-10 digits. We then have that . However, the product of the digits of is , with equality only when is a one-digit integer. Therefore the product of the digits of is always at most , with equality only when is a base-10 digit. This implies that , so . Every natural number from 1 to 12 satisfies this inequality, so we only need to check these possibilities. It is easy to rule out 1 through 11, since for those values. However, , which is the product of the digits of 12. Therefore is the only natural number with the desired properties.
Solution 2(SFFT)
It is pretty obvious that cannot be three digits or more, because then is way too big.
Write where and are digits satisfying . Then, we can use SFFT: We have It is therefore clear that must be either or . We can then split into two cases:
We have or , which is only satisfied when or .
We have . This is only satisfied when , or . Therefore, , and so
~mathboy100
Solution 3
Let,
Now note that, if is a prime such that then .
That means,
But, which means don't divivde
So, and
It is easy to see that has one solution and that is ( Prove it by contradiction)
So,
Remarks (added by pf02, August 2024)
Solutions 2 and 3 are not satisfactory. In fact, they can not be called solutions, since they make statements which are not proven. Specifically:
In Solution 2, the author writes "It is pretty obvious that cannot be three digits or more, because then is way too big." This is intuitively true, but not obvious at all. As a crucial step in the solution, it should be proven. Later, the author states
". It is therefore clear that must be either or ".
First, the last term should be instead of . Either way, the conclusion about is not clear at all. As a second crucial step in the solution, it should be proven.
In Solution 3, the notation and writing are very confusing. However, a diligent reader can make sense of them. But in this solution as well, there are statements which beg for a proof. The first such statement is
" which means don't divide ".
(When writing the author means the square of an arbitrary natural number, not the square of the number used in the line above this statement.) Neither the modulo statements, nor the conclusion are obvious; proofs should be given. The second unproven statement is
". It is easy to see that has one solution and that is . (Prove it by contradiction.)"
(The author means "the equation has a unique solution for ".) The conclusion about the uniqueness of is not easy to see, and as a crucial step in the solution, it should be proven.
Below, I will give corrected, complete, and somewhat simplified versions of these two solutions.
Solution 2 (corrected and complete)
Let the decimal expansion of be , where are base-10 digits. Let us prove first that .
Using and the fact that this expression equals the product we have that . Since has digits, we also have . Thus, we have . We will show that this can not be true for .
Divide by , rearrange factors and terms, and get . Again using , we get . This is false for , so the number of digits of can not be more than .
Let then , with the digits of . We have . By solving the quadratic equation we see that the inequality is true when .
At this point, we could simply check which of the numbers has the product of its digits equal to . It would turn out that is the only one. But we can take a short cut by writing . and using that or . In the case we get the equation in which has no integer solutions. In the case we get the equation in , which has solutions and . Since is a digit, is the only acceptable solution, so .
Solution 3 (corrected and complete)
Let . Since is a product of digits, the only prime factors of can be . Write .
Note that if is a natural number then or . Indeed, or or for some . By writing out the statement follows immediately. Then or , so can not be a factor of .
Similarly, if is a natural number then or . Then or , so can not be a factor of .
And finally if is a natural number then or . Then or , so can not be a factor of .
The only possible prime factor of is . So for some . Write this as , or .
Clearly is not acceptable because the equation in has no integer solutions.
If the left hand side is divisible by , but not by . The right hand side is not divisible by if is odd, and is divisible by if is even. So yields no solutions.
If , the equation becomes which has solutions . The only acceptable solution is .
See Also
1968 IMO (Problems) • Resources | ||
Preceded by Problem 1 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 3 |
All IMO Problems and Solutions |