1993 AHSME Problems/Problem 7
Problem
The symbol stands for an integer whose base-ten representation is a sequence of
ones. For example,
, etc. When
is divided by
, the quotient
is an integer whose base-ten representation is a sequence containing only ones and zeroes. The number of zeros in
is:
Solution
Because the only digits we are using are 1s and zeroes (they say that in question) we essentially perform the operation in binary and convert back to base 10 to get the answer.
Notice then that. It follows that
and
Notice to compute
we take advantage of the fact that
Our quotient then is just
Notice then this just adigit in binary with
![]()
s which occupy the
slots for the
![]()
we have. Our answer then is just
![]()
See also
1993 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
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.