Difference between revisions of "1960 IMO Problems/Problem 1"
(→Video Solution) |
|||
(23 intermediate revisions by 11 users not shown) | |||
Line 3: | Line 3: | ||
Determine all three-digit numbers <math>N</math> having the property that <math>N</math> is divisible by 11, and <math>\dfrac{N}{11}</math> is equal to the sum of the squares of the digits of <math>N</math>. | Determine all three-digit numbers <math>N</math> having the property that <math>N</math> is divisible by 11, and <math>\dfrac{N}{11}</math> is equal to the sum of the squares of the digits of <math>N</math>. | ||
− | ==Solution== | + | == Solutions == |
+ | ===Solution 1=== | ||
+ | Let <math>N = 100a + 10b+c</math> for some digits <math>a,b,</math> and <math>c</math>. Then <cmath> 100a + 10b+c = 11m</cmath> for some <math>m</math>. We also have <math>m=a^2+b^2+c^2</math>. Substituting this into the first equation and simplification, we get <cmath>100a+10b+c = 11a^2 +11b^2 +11c^2</cmath> For an integer divisible by <math>11</math>, the the sum of digits in the odd positions minus the sum of digits in the even positions is divisible by <math>11</math>. Thus we get: <math>b = a + c</math> or <math>b = a + c - 11</math>. | ||
− | {{solution}} | + | Case <math>1</math>: Let <math>b=a+c</math>. We get <cmath>100a+c+10a+10c = 11a^2 +11c^2+11(a+c)^2</cmath> <cmath>10a+c = 2a^2+2ac+2c^2</cmath> Since the right side is even, the left side must also be even. Let <math>c=2q</math> for some <math>q = 0,1,2,3,4</math>. Then <cmath>10a+2q=2a^2+4aq+8q^2</cmath><cmath>5a+q=a^2+2aq+4q^2</cmath> |
+ | Substitute <math>q=0,1,2,3,4</math> into the last equation and then solve for <math>a</math>. | ||
+ | |||
+ | When <math>q=0</math>, we get <math>a=5</math>. Thus <math>c=0</math> and <math>b=5</math>. We get that <math>N=550</math> which works. | ||
+ | |||
+ | When <math>q=1</math>, we get that <math>a</math> is not an integer. There is no <math>N</math> for this case. | ||
+ | |||
+ | When <math>q=2</math>, we get that <math>a</math> is not an integer. There is no <math>N</math> for this case. | ||
+ | |||
+ | When <math>q=3</math>, we get that <math>a</math> is not an integer. There is no <math>N</math> for this case. | ||
+ | |||
+ | When <math>q=4</math>, we get that <math>a</math> is not an integer. There is no <math>N</math> for this case. | ||
+ | |||
+ | |||
+ | Case <math>2</math>: Let <math>b = a + c - 11</math>. We get <cmath>100a+c+10a+10c -110= 11(a^2+(a+c)^2-22(a+c)+c^2+121)</cmath> <cmath> 10a+c=2a^2+2c^2+2ac-22a-22c+131</cmath> <cmath>2(a-8)^2+2(c-\frac{23}{4})^2+2ac-\frac{505}{8}=0</cmath> | ||
+ | Now we test all <math>c=0\rightarrow10</math>. When <math>c=0,1,2,4,5,6,7,8,9</math>, we get no integer solution to <math>a</math>. Thus, for these values of <math>c</math>, there is no valid <math>N</math>. However, when <math>c=3</math>, we get <cmath>2(a-8)^2+2(3-\frac{23}{4})^2+6a-\frac{505}{8}=0</cmath> <cmath>2(a-8)^2+6a-48 = 0</cmath> We get that <math>a=8</math> is a valid solution. For this case, we get <math>a=8,b=0,c=3</math>, so <math>N=803</math>, and this is a valid value. Thus, the answers are <math>\boxed{N=550,803}</math>. | ||
+ | |||
+ | ===Solution 2=== | ||
+ | |||
+ | Define a '''ten''' to be all ten positive integers which begin with a fixed tens digit. | ||
+ | |||
+ | We can make a systematic approach to this: | ||
+ | |||
+ | |||
+ | By inspection, <math>\dfrac{N}{11}</math> must be between 10 and 90 inclusive. That gives us 8 tens to check, and 90 as well. | ||
+ | |||
+ | For a given ten, the sum of the squares of the digits of <math>N</math> increases faster than <math>\dfrac{N}{11}</math>, so we can have at most one number in every ten that works. | ||
+ | |||
+ | We check the first ten: | ||
+ | |||
+ | <math>11*11=121</math> | ||
+ | |||
+ | <math>1^2+2^2+1^2=4</math> | ||
+ | |||
+ | <math>12*11=132</math> | ||
+ | |||
+ | <math>1^2+3^2+2^2=14</math> | ||
+ | |||
+ | 11 is too small and 12 is too large, so all numbers below 11 will be too small and all numbers above 12 will be too large, so no numbers in the first ten work. | ||
+ | |||
+ | We try the second ten: | ||
+ | |||
+ | <math>21*11=231</math> | ||
+ | |||
+ | <math>2^2+3^2+1^2=14</math> | ||
+ | |||
+ | <math>22*11=242</math> | ||
+ | |||
+ | <math>2^2+4^2+2^2=24</math> | ||
+ | |||
+ | Therefore, no numbers in the second ten work. | ||
+ | |||
+ | We continue, to find out that 50 and 73 are the only ones that works. | ||
+ | |||
+ | <math>N=50*11=550</math>, <math>N=73*11=803</math> so there are two <math>N</math> that works. | ||
+ | |||
+ | ===Solution 3=== | ||
+ | |||
+ | Note that there are only 900 three-digit numbers. Of these, only 81 are divisible by 11. This brings to mind the great strategy of listing and bashing. Being organized while listing will get you the answer. There is plenty of time on the IMO, and listing is highly unlikely to miss cases. We end up getting <math>\boxed{N=550,803}</math>. | ||
+ | |||
+ | ===Solution 4=== | ||
+ | |||
+ | |||
+ | https://artofproblemsolving.com/community/c6h54826p22231968 | ||
+ | |||
+ | |||
+ | ~franzliszt | ||
+ | |||
+ | ===Video Solution=== | ||
+ | https://www.youtube.com/watch?v=LB2KTsnnmSQ&list=PLa8j0YHOYQQJGzkvK2Sm00zrh0aIQnof8&index=2 | ||
+ | - AMBRIGGS | ||
+ | |||
+ | https://youtu.be/DRii5VjLk70 [Video Solution] | ||
==See Also== | ==See Also== | ||
− | {{ | + | {{IMO7 box|year=1960|before=First Question|num-a=2}} |
Latest revision as of 04:01, 17 August 2022
Contents
Problem
Determine all three-digit numbers having the property that is divisible by 11, and is equal to the sum of the squares of the digits of .
Solutions
Solution 1
Let for some digits and . Then for some . We also have . Substituting this into the first equation and simplification, we get For an integer divisible by , the the sum of digits in the odd positions minus the sum of digits in the even positions is divisible by . Thus we get: or .
Case : Let . We get Since the right side is even, the left side must also be even. Let for some . Then Substitute into the last equation and then solve for .
When , we get . Thus and . We get that which works.
When , we get that is not an integer. There is no for this case.
When , we get that is not an integer. There is no for this case.
When , we get that is not an integer. There is no for this case.
When , we get that is not an integer. There is no for this case.
Case : Let . We get
Now we test all . When , we get no integer solution to . Thus, for these values of , there is no valid . However, when , we get We get that is a valid solution. For this case, we get , so , and this is a valid value. Thus, the answers are .
Solution 2
Define a ten to be all ten positive integers which begin with a fixed tens digit.
We can make a systematic approach to this:
By inspection, must be between 10 and 90 inclusive. That gives us 8 tens to check, and 90 as well.
For a given ten, the sum of the squares of the digits of increases faster than , so we can have at most one number in every ten that works.
We check the first ten:
11 is too small and 12 is too large, so all numbers below 11 will be too small and all numbers above 12 will be too large, so no numbers in the first ten work.
We try the second ten:
Therefore, no numbers in the second ten work.
We continue, to find out that 50 and 73 are the only ones that works.
, so there are two that works.
Solution 3
Note that there are only 900 three-digit numbers. Of these, only 81 are divisible by 11. This brings to mind the great strategy of listing and bashing. Being organized while listing will get you the answer. There is plenty of time on the IMO, and listing is highly unlikely to miss cases. We end up getting .
Solution 4
https://artofproblemsolving.com/community/c6h54826p22231968
~franzliszt
Video Solution
https://www.youtube.com/watch?v=LB2KTsnnmSQ&list=PLa8j0YHOYQQJGzkvK2Sm00zrh0aIQnof8&index=2 - AMBRIGGS
https://youtu.be/DRii5VjLk70 [Video Solution]
See Also
1960 IMO (Problems) | ||
Preceded by First Question |
1 • 2 • 3 • 4 • 5 • 6 • 7 | Followed by Problem 2 |