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 "1991 OIM Problems/Problem 4"
Line 33: Line 33:
  
 
Since <math>12345\le N \le 98765</math>, then <math>15 \le \sum_{i=1}^{5}d_i \le 35</math>
 
Since <math>12345\le N \le 98765</math>, then <math>15 \le \sum_{i=1}^{5}d_i \le 35</math>
 +
 +
<math>x_{i}=\begin{cases} \frac{x_{0}}{2^{i}} & 1 \le i \le 1994 \\ \frac{1}{x_{i-1}} & i=1995\end{cases}</math>
 +
  
 
<math>\begin{cases} (15)(1332)=19980; & 1+9+9+8+0=27; & 27\ne 15; & \text{NO}\\(35)(1332)=46620; & 4+6+6+2+0=18; & 18\ne 35; & \text{NO}\end{cases}</math>
 
<math>\begin{cases} (15)(1332)=19980; & 1+9+9+8+0=27; & 27\ne 15; & \text{NO}\\(35)(1332)=46620; & 4+6+6+2+0=18; & 18\ne 35; & \text{NO}\end{cases}</math>

Revision as of 22:25, 13 December 2023

Problem

Find a number $N$ of five different and non-zero digits, which is equal to the sum of all the numbers of three different digits that can be formed with five digits of $N$.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

Let $N=d_1d_2d_3d_4d_5$ or in a better format: $N=10000d_1+1000d_2+100d_3+10d_4+d_5$

The total number of combinations is given the following way:

For the first digit of any three-digit number we have 5 numbers to chose from.

For the second digit we have 4 numbers to chose from.

For the third digit we have 3 numbers to chose from.

Total numbers of three digit numbers is (5)(4)(3)=60.

Now we need to find their sum.

From all 60 ways, in the first digit we will have each digit of N showing with (4)(3)=12 configurations.

From all 60 ways, in the second digit we will have each digit of N showing with (4)(3)=12 configurations.

From all 60 ways, in the last digit we will have each digit of N showing with (4)(3)=12 configurations.

Therefore the sum, since each digit of $N$ is shown in each position 12 times, then

$S=\left( 12\sum_{i=1}^{5}d_i \right)100+\left( 12\sum_{i=1}^{5}d_i \right)10+\left( 12\sum_{i=1}^{5}d_i \right)$

$S=1332 \sum_{i=1}^{5}d_i =N$

Since $12345\le N \le 98765$, then $15 \le \sum_{i=1}^{5}d_i \le 35$

$x_{i}=\begin{cases} \frac{x_{0}}{2^{i}} & 1 \le i \le 1994 \\ \frac{1}{x_{i-1}} & i=1995\end{cases}$


$\begin{cases} (15)(1332)=19980; & 1+9+9+8+0=27; & 27\ne 15; & \text{NO}\\(35)(1332)=46620; & 4+6+6+2+0=18; & 18\ne 35; & \text{NO}\end{cases}$ (Error compiling LaTeX. Unknown error_msg)


Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

See also

https://www.oma.org.ar/enunciados/ibe6.htm

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1991_OIM_Problems/Problem_4&oldid=207158"