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

Difference between revisions of "1988 AIME Problems"

m (→‎Problem 7: -space)
(Inserted the problem)
Line 1: Line 1:
 
== Problem 1 ==
 
== Problem 1 ==
 +
One commercially available ten-button lock may be opened by depressing -- in any order -- the correct five buttons. The sample shown below has <math>\{1, 2, 3, 6, 9\}</math> as its combination. Suppose that these locks are redesigned so that sets of as many as nine buttons or as few as one button could serve as combinations. How many additional combinations would this allow?
 +
[[Image:1988-1.png]]
  
 
[[1988 AIME Problems/Problem 1|Solution]]
 
[[1988 AIME Problems/Problem 1|Solution]]

Revision as of 12:35, 27 March 2007

Problem 1

One commercially available ten-button lock may be opened by depressing -- in any order -- the correct five buttons. The sample shown below has $\{1, 2, 3, 6, 9\}$ as its combination. Suppose that these locks are redesigned so that sets of as many as nine buttons or as few as one button could serve as combinations. How many additional combinations would this allow? 1988-1.png

Solution

Problem 2

Solution

Problem 3

Solution

Problem 4

Solution

Problem 5

Solution

Problem 6

Solution

Problem 7

Solution

Problem 8

Solution

Problem 9

Solution

Problem 10

Solution

Problem 11

Solution

Problem 12

Solution

Problem 13

Solution

Problem 14

Solution

Problem 15

Solution

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1988_AIME_Problems&oldid=14215"