Difference between revisions of "1989 AIME Problems/Problem 14"
m (→Problem) |
m |
||
(3 intermediate revisions by 2 users not shown) | |||
Line 13: | Line 13: | ||
<math>(-3+i)^1=-3+i ; (-3+i)^2=8-6i ; (-3+i)^3=-18+26i</math> | <math>(-3+i)^1=-3+i ; (-3+i)^2=8-6i ; (-3+i)^3=-18+26i</math> | ||
− | So we | + | So we solve the [[diophantine equation]] <math>a_1-6a_2+26a_3=0 \Longrightarrow a_1-6a_2=-26a_3</math>. |
− | The minimum the left hand side can go is -54, so <math>a_3\leq 2</math>, so we try cases: | + | The minimum the left-hand side can go is -54, so <math>1\leq a_3 \leq 2</math> since <math>a_3</math> can't equal 0, so we try cases: |
*Case 1: <math>a_3=2</math> | *Case 1: <math>a_3=2</math> | ||
Line 21: | Line 21: | ||
*Case 2: <math>a_3=1</math> | *Case 2: <math>a_3=1</math> | ||
:The only solution to that is <math>(a_1, a_2, a_3)=(4,5,1)</math>. | :The only solution to that is <math>(a_1, a_2, a_3)=(4,5,1)</math>. | ||
− | |||
− | |||
− | So we have | + | So we have four-digit integers <math>(292a_0)_{-3+i}</math> and <math>(154a_0)_{-3+i}</math>, and we need to find the sum of all integers <math>k</math> that can be expressed by one of those. |
<math>(292a_0)_{-3+i}</math>: | <math>(292a_0)_{-3+i}</math>: | ||
Line 33: | Line 31: | ||
We plug the first three digits into base 10 to get <math>10+a_0</math>. The sum of the integers <math>k</math> in that form is <math>145</math>. The answer is <math>345+145=\boxed{490}</math>. | We plug the first three digits into base 10 to get <math>10+a_0</math>. The sum of the integers <math>k</math> in that form is <math>145</math>. The answer is <math>345+145=\boxed{490}</math>. | ||
+ | ~minor edit by [[User:Yiyj1|Yiyj1]] | ||
== See also == | == See also == |
Latest revision as of 00:37, 25 August 2024
Problem
Given a positive integer , it can be shown that every complex number of the form , where and are integers, can be uniquely expressed in the base using the integers as digits. That is, the equation
is true for a unique choice of non-negative integer and digits chosen from the set , with . We write
to denote the base expansion of . There are only finitely many integers that have four-digit expansions
Find the sum of all such ,
Solution
First, we find the first three powers of :
So we solve the diophantine equation .
The minimum the left-hand side can go is -54, so since can't equal 0, so we try cases:
- Case 1:
- The only solution to that is .
- Case 2:
- The only solution to that is .
So we have four-digit integers and , and we need to find the sum of all integers that can be expressed by one of those.
:
We plug the first three digits into base 10 to get . The sum of the integers in that form is .
:
We plug the first three digits into base 10 to get . The sum of the integers in that form is . The answer is . ~minor edit by Yiyj1
See also
1989 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.