Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1991 AHSME Problems/Problem 26

Revision as of 22:53, 18 February 2012 by Ckorr2003 (talk | contribs) (Created page with "An <math>n</math>-digit positive integer is cute if its <math>n</math> digits are an arrangement of the set <math>\{1,2,...,n\}</math> and its first <math>k</math> digits form a...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

An $n$-digit positive integer is cute if its $n$ digits are an arrangement of the set $\{1,2,...,n\}$ and its first $k$ digits form an integer that is divisible by $k$ , for $k = 1,2,...,n$. For example, $321$ is a cute $3$-digit integer because $1$ divides $3$, $2$ divides $32$, and $3$ divides $321$. Howmany cute $6$-digit integers are there?

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1991_AHSME_Problems/Problem_26&oldid=44844"