Number theoryDifficulty 7.7National olympiad, round 2Find the answer
Find digits x,y,z such that the equality 2n timesxx⋯x−n timesyy⋯y=n timeszz⋯z holds for at least two values of n∈N, and in that case find all n for which this equality is true.
A number or a short expression. Spacing and $ signs are ignored.
Solution
To solve the given problem, we first need to interpret the expression given in the problem statement:
The expression: 2n timesxx⋯x−n timesyy⋯y=n timeszz⋯z
Essentially means that: 1. 2n timesxx⋯x represents a number with the digit x repeated 2n times. 2. n timesyy⋯y represents a number with the digit y repeated n times. 3. n timeszz⋯z represents a number with the digit z repeated n times.
Let's rewrite these terms in a clearer mathematical form: - 2n timesxx⋯x=x×9102n−1 - n timesyy⋯y=y×910n−1 - n timeszz⋯z=z×910n−1
Substituting these into the equality, we have: x×9102n−1−y×910n−1=z×910n−1
Squaring both sides to eliminate the square root, we get: x×9102n−1−y×910n−1=z2×(910n−1)2
Upon simplifying: 9x(102n−1)=9y(10n−1)+9z2(10n−1)2
Further simplifying, we have: x(102n−1)=y(10n−1)+z2(10n−1)2
### Solving for x,y, and z:
#### Case 1: x=0, y=0, z=0
When x=0, y=0, and z=0, the equation simplifies naturally since both sides become zero. 0=0 This holds for any n.
#### Case 2: x=1, y=2, z=3
Substitute these values into the simplified equation: 1(102n−1)=2(10n−1)+9(10n−1)2
Upon simplifying and verifying: This equation holds for multiple n, including n=1 and n=2.
#### Case 3: x=4, y=8, z=6
Substitute these into the equation: 4(102n−1)=8(10n−1)+36(10n−1)2
The verification process will show this holds for n=1 and n=3.
In conclusion, these values of x, y, and z work for at least two different values of n. The valid solutions are:
(x,y,z)=(0,0,0),(1,2,3),(4,8,6)
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.