Difference between revisions of "1993 AHSME Problems/Problem 30"
(→Solution 2) |
|||
(11 intermediate revisions by the same user not shown) | |||
Line 34: | Line 34: | ||
== Solution 2== | == Solution 2== | ||
− | <math>x_5</math> | + | <math>x_5 = \left\{ 2^5x_0 \right\}</math> |
+ | |||
+ | <math>\therefore x_0 = \left\{ 2^5x_0 \right\}</math> | ||
+ | |||
+ | <math>Suppose \ x_0 = 2^5 x_0 - k \ (k \geq 0)</math> | ||
+ | |||
+ | <math>31x_0 = k</math> | ||
+ | |||
+ | <math>x_0 = \frac{k}{31}</math> | ||
+ | |||
+ | <math>\therefore k = 0, 1, 2,..., 30</math> | ||
+ | |||
+ | select (D) | ||
+ | |||
+ | ~ JiYang | ||
== See also == | == See also == |
Latest revision as of 22:57, 24 October 2024
Contents
Problem
Given , let for all integers . For how many is it true that ?
Solution
We are going to look at this problem in binary.
If , then which means that and so
If then which means that .
Using the same logic, we notice that this sequence cycles and that since we notice that .
We have possibilities for each of to but we can't have so we have
-mathman523
Solution 2
select (D)
~ JiYang
See also
1993 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 29 |
Followed by Problem 30 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.