Difference between revisions of "1991 AHSME Problems/Problem 26"
m |
m (→Solution) |
||
| Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
| − | <math>\fbox{}</math> | + | <math>\fbox{C}</math> |
== See also == | == See also == | ||
Revision as of 15:57, 28 September 2014
Problem
An 
-digit positive integer is cute if its digits are an arrangement of the set 
and its first
digits form an integer that is divisible by , for 
. For example, 
is a cute 
-digit integer because 
divides , 
divides 
, and divides . Howmany cute 
-digit integers are there?
Solution
See also
| 1991 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 25 |
Followed by Problem 27 | |
| 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. 
