1969 AHSME Problems

Revision as of 16:31, 1 October 2014 by Timneh (talk | contribs) (Created page with "==Problem 1== Solution ==Problem 2== Solution ==Problem 3== [[1969 AHSME Problems/Problem 3|Solution]...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 1

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

Problem 16

Solution

Problem 17

Solution

Problem 18

Solution

Problem 19

Let $n$ be the number of ways $10$ dollars can be changed into dimes and quarters, with at least one of each coin being used. Then $n$ equals:


Solution

Problem 20

Solution

Problem 21

Solution

Problem 22

Solution

Problem 23

Solution

Problem 24

Solution

Problem 25

Solution

Problem 26

Solution

Problem 27

Solution

Problem 28

Solution

Problem 29

Solution

Problem 30

Solution

Problem 31

Solution

Problem 32

Solution

Problem 33

Solution

Problem 34

Solution

Problem 35

Solution The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png