Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1968 IMO Problems/Problem 2"
Line 53: Line 53:
  
 
<math> \blacksquare</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>".
 +
 +
Neither the modulo statements, nor the conclusion are obvious;
 +
proofs should be given.  The second one 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)==
 +
 +
 +
 +
 +
TO BE CONTINUED.  I AM SAVING UNFINISHED TEXT SO I DON'T LOSE WORK DONE SO FAR.
  
 
==See Also==
 
==See Also==
  
 
{{IMO box|year=1968|num-b=1|num-a=3}}
 
{{IMO box|year=1968|num-b=1|num-a=3}}
−
* [http://www.artofproblemsolving.com/Forum/viewtopic.php?p=361673&sid=6798c42a2ab57f3ca82ffba974ed589c#p361673 Discussion on AoPS/MathLinks]
 
  
 
[[Category:Olympiad Number Theory Problems]]
 
[[Category:Olympiad Number Theory Problems]]

Revision as of 13:36, 20 August 2024

Problem

Find all natural numbers $x$ such that the product of their digits (in decimal notation) is equal to $x^2 - 10x - 22$.

Solution 1

Let the decimal expansion of $x$ be $\overline{d_1d_2d_3\dots d_n}$, where $d_i$ are base-10 digits. We then have that $x\geq d_1\cdot 10^{n-1}$. However, the product of the digits of $x$ is $d_1d_2d_3\dots d_n\leq d_1\cdot 10\cdot 10\dots 10=d_1\cdot 10^{n-1}$, with equality only when $x$ is a one-digit integer. Therefore the product of the digits of $x$ is always at most $x$, with equality only when $x$ is a base-10 digit. This implies that $x^2-10x-22\leq x$, so $x^2-11x-22\leq 0$. 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 $x^2-10x-22<0$ for those values. However, $12^2-10\cdot 12-22=2$, which is the product of the digits of 12. Therefore $\boxed{12}$ is the only natural number with the desired properties. $\blacksquare$

Solution 2(SFFT)

It is pretty obvious that $x$ cannot be three digits or more, because then $x^2 - 10x - 22$ is way too big.

Write $x = 10a + b$ where $a$ and $b$ are digits satisfying $0 \leq a, b < 10$. Then, we can use SFFT: \[(10a + b)^2 - 10(10a + b) - 22 = ab\] \[(10a + b)^2 - 10(10a + b) - 24 = ab - 2\] \[(10a + b + 2)(10a + b - 12) = ab - 2.\] We have \[(10a + b + 2)(10a + b - 12) \geq (10a + 2)(10a - 12) = 100a^2 - 100a + 24 = 100(a^2 - a) + 24.\] It is therefore clear that $a$ must be either $0$ or $1$. We can then split into two cases:

$\mathbf{a = 0:}$

We have $(b + 2)(b - 12) = -2$ or $b^2 - 10b - 22 = 0$, which is only satisfied when $b = -2$ or $12$.

$\mathbf{a = 1:}$

We have $(b + 12)(b - 2) = b - 2$. This is only satisfied when $b = 2$, or $b + 12 = 0$. Therefore, $b = 2$, and so $x = \boxed{12}.\square$

~mathboy100

Solution 3

Let, $x^2-10x-22=y$

$\implies x^2-10+25-47=y$

$\implies (x-5)^2=47+y$

Now note that, if $p$ is a prime such that $p|y$ then $7\geq p$.

That means, $y=2^a*3^b*5^c*7^d$

But, $a^2 \not\equiv 2 (mod3), a^2 \not\equiv 2 (mod5), a^2 \not\equiv 5 (mod7)$ which means $3,5,7$ don't divivde $(x-5)^2-47=y.$

So, $y=2^a$ and $y+17=2^a+47=(x-5)^2$

It is easy to see that $a$ has one solution and that is $2.$( Prove it by contradiction)

So, $(x-5)^2=47+2=49$

$\implies x=12$

$\blacksquare$

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 $x$ cannot be three digits or more, because then $x^2 - 10x - 22$ 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

"$(10a + b + 2)(10a + b - 12) \ge \cdots = 100(a^2 - a) + 24$. It is therefore clear that $a$ must be either $0$ or $1$".

First, the last term should be $-24$ instead of $24$. Either way, the conclusion about $a$ 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

"$a^2 \not\equiv 2 (mod\ 3), a^2 \not\equiv 2 (mod\ 5), a^2 \not\equiv 5 (mod\ 7)$ which means $3, 5, 7$ don't divide $(x - 5)^2 - 47 = y$".

Neither the modulo statements, nor the conclusion are obvious; proofs should be given. The second one is

"$2^a + 47 = (x - 5)^2$. It is easy to see that $a$ has one solution and that is $2$. (Prove it by contradiction.)"

(The author means "the equation has a unique solution for $a$".) The conclusion about the uniqueness of $a$ 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)

TO BE CONTINUED. I AM SAVING UNFINISHED TEXT SO I DON'T LOSE WORK DONE SO FAR.

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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1968_IMO_Problems/Problem_2&oldid=225406"