2014 AIME I Problems

2014 AIME I (Answer Key) | AoPS Contest Collections • PDF

Instructions This is a 15-question, 3-hour examination. All answers are integers ranging from to , inclusive. Your score will be the number of correct answers; i.e., there is neither partial credit nor a penalty for wrong answers. No aids other than scratch paper, graph paper, ruler, compass, and protractor are permitted. In particular, calculators and computers are not permitted.

1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Problem 1

The 8 eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of 50 mm and a length of 80 mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least 200 mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters.

Solution

Problem 2

An urn contains green balls and blue balls. A second urn contains green balls and blue balls. A single ball is drawn at random from each urn. The probability that both balls are of the same color is 0.58. Find .

Solution

Problem 3

Find the number of rational numbers such that when is written as a fraction in lowest terms, the numerator and the denominator have a sum of 1000.

Solution

Problem 4

Jon and Steve ride their bicycles along a path that parallels two side-by-side train tracks running the east/west direction. Jon rides east as 20 miles per hour, and Steve rides west at 20 miles per hour. Two trains of equal length, traveling in opposite directions at constant but different speeds each pass the two riders. Each train takes exactly 1 minute to go past Jon. The westbound train takes 10 times as long as the eastbound train to go past Steve. The length of each train is , where and are relatively prime positive integers. Find .

Solution

Problem 5

Solution

Problem 6

The graphs and have y-intercepts of 2013 and 2014, respectively, and each graph has two positive integer x-intercepts. Find .

Solution

Problem 7

Let and be complex numbers such that and . Let . The maximum possible value of can be written as , where and are relatively prime positive integers. Find . (Note that , for w , denotes the measure of the angle that the ray from 0 to makes with the positive real axis in the complex plane.

Solution

Problem 8

The positive integers and both end in the same sequence of four digits when written in base 10, where digit a is not zero. Find the three-digit number .

Solution

Problem 9

Let be the three real roots of the equation . Find .

Solution

Problem 10

Solution

Problem 11

A token starts at the point of an -coordinate grid and them makes a sequence of six moves. Each move is 1 unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of is , where and are relatively prime positive integers. Find .

Solution

Problem 12

Solution

Problem 13

Solution

Problem 14

Let be the largest real solution to the equation

There are positive integers and such that . Find .

Solution

Problem 15

Solution

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