2018 AIME I Problems

2018 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

Let be the number of ordered pairs of integers with and such that the polynomial can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when is divided by .

Solution

Problem 2

Solution

Problem 3

Kathy has \(5\) red cards and \(5\) green cards. She shuffles the \(10\) cards and lays out \(5\) of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders \(RRGGG, GGGGR,\) or \(RRRRR\) will make Kathy happy, but \(RRRGR\) will not. The probability that Kathy will be happy is \( \dfrac{m}{n}\), where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\).

Solution

Problem 4

Solution

Problem 5

Solution

Problem 6

Solution

Problem 7

Solution

Problem 8

Solution

Problem 9

Find the number of four-element subsets of with the property that two distinct elements of a subset have a sum of , and two distinct elements of a subset have a sum of . For example, and are two such subsets.

Solution

Problem 10

The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point \(A\). At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a circular clockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path \(AJABCHCHIJA\), which has \(10\) steps. Let \(n\) be the number of paths with \(15\) steps that begin and end at point \(A\). Find the remainder when \(n\) is divided by \(1000\).

Solution

Problem 11

Solution

Problem 12

Solution

Problem 13

Solution

Problem 14

Solution

Problem 15

Solution

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