Difference between revisions of "1987 AHSME Problems/Problem 16"
(Created page with "==Problem== A cryptographer devises the following method for encoding positive integers. First, the integer is expressed in base <math>5</math>. Second, a 1-to-1 correspondence...") |
(→Problem) |
||
| Line 10: | Line 10: | ||
\textbf{(C)}\ 82 \qquad | \textbf{(C)}\ 82 \qquad | ||
\textbf{(D)}\ 108 \qquad | \textbf{(D)}\ 108 \qquad | ||
| − | \textbf{(E)}\ 113 </math> | + | \textbf{(E)}\ 113 </math> |
== See also == | == See also == | ||
Revision as of 21:54, 3 June 2015
Problem
A cryptographer devises the following method for encoding positive integers. First, the integer is expressed in base 
.
Second, a 1-to-1 correspondence is established between the digits that appear in the expressions in base and the elements of the set
. Using this correspondence, the cryptographer finds that three consecutive integers in increasing
order are coded as 
, respectively. What is the base-
expression for the integer coded as 
?
See also
| 1987 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 15 |
Followed by Problem 17 | |
| 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. 
