Art of Problem Solving AoPS Online Beast Academy AoPS Academy

2024 AIME I Problems

2024 AIME I (Answer Key)
Printable version | AoPS Contest Collections • PDF

Instructions

1. 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.
2. 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

Contents
1 Problem 1
2 Problem 2
3 Problem 3
4 Problem 4
5 Problem 5
6 Problem 6
7 Problem 7
8 Problem 8
9 Problem 9
10 Problem 10
11 Problem 11
12 Problem 12
13 Problem 13
14 Problem 14
15 Problem 15
16 See also
Problem 1
Every morning Aya goes for a -kilometer-long walk and stops at a coffee shop afterwards. When she walks at a constant speed of kilometers
per hour, the walk takes her hours, including minutes spent in the coffee shop. When she walks at kilometers per hour, the walk takes

her hours and minutes, including minutes spent in the coffee shop. Suppose Aya walks at kilometers per hour. Find the number of

minutes the walk takes her, including the minutes spent in the coffee shop.

Solution
Problem 2
There exist real numbers and , both greater than 1, such that . Find .

Solution
Problem 3
Alice and Bob play the following game. A stack of tokens lies before them. The players take turns with Alice going first. On each turn, the player
removes token or tokens from the stack. The player who removes the last token wins. Find the number of positive integers less than or
equal to such that there is a strategy that guarantees that Bob wins, regardless of Alice’s moves.

Solution
Problem 4
Jen enters a lottery by picking distinct numbers from numbers are randomly chosen from She wins a
prize if at least two of her numbers were of the randomly chosen numbers, and wins the grand prize if all four of her numbers were the randomly
chosen numbers. The probability of her winning the grand prize given that she won a prize is where and are relatively prime positive
integers. Find .

Solution
Problem 5
Rectangle has dimensions and , and rectangle has dimensions and
. Points , , , and lie on line in that order, and and lie on opposite sides of line , as shown. Points , ,
, and lie on a common circle. Find .

Solution
Problem 6
Consider the paths of length that follow the lines from the lower left corner to the upper right corner on an grid. Find the number of such
paths that change direction exactly four times, like in the examples shown below.

Solution
Problem 7
Find the largest possible real part of

where is a complex number with .

Solution
Problem 8
Eight circles of radius can be placed tangent to of so that the circles are sequentially tangent to each other, with the first
circle being tangent to and the last circle being tangent to , as shown. Similarly, circles of radius can be placed tangent to

in the same manner. The inradius of can be expressed as , where and are relatively prime positive integers. Find

Solution
Problem 9

Let be a rhombus whose vertices all lie on the hyperbola and are in that order. If its diagonals intersect at the origin,
find the largest number less than for all rhombuses .

Solution
Problem 10
Let be a triangle inscribed in circle . Let the tangents to at and intersect at point , and let intersect at . If

, , and , can be written as the form , where and are relatively prime integers. Find .

Solution
Problem 11
Each vertex of a regular octagon is independently colored either red or blue with equal probability. The probability that the octagon can then be
rotated so that all of the blue vertices end up at positions where there were originally red vertices is , where and are relatively prime positive
integers. What is ?

Solution
Problem 12
Define and . Find the number of intersections of the graphs of and
.

Solution
Problem 13
Let be the least prime number for which there exists a positive integer such that is divisible by . Find the least positive integer
such that is divisible by .

Solution
Problem 14

Let be a tetrahedron such that , , and . There exists a

point inside the tetrahedron such that the distances from to each of the faces of the tetrahedron are all equal. This distance can be written in

the form , when , , and are positive integers, and are relatively prime, and is not divisible by the square of any prime. Find

Solution
Problem 15
Let be the set of rectangular boxes with surface area and volume . Let be the radius of the smallest sphere that can contain each of the

rectangular boxes that are elements of . The value of can be written as , where and are relatively prime positive integers. Find .

Solution
See also
2024 AIME I (Problems • Answer Key • Resources)
Preceded by Followed by
2023 AIME II 2024 AIME II
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

American Invitational Mathematics Examination

AIME Problems and Solutions
Mathematics competition resources

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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2024_AIME_I_Problems&oldid=235191"

Copyright © 2024 Art of Problem Solving