Difference between revisions of "2016 AIME I Problems"

Revision as of 13:27, 4 March 2016

2016 AIME I (Answer Key) Printable version \| AoPS Contest Collections • PDF
Instructions This is a 15-question, 3-hour examination. All answers are integers ranging from $000$ to $999$ , 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

Solution

Problem 2

Solution

Problem 3

Solution

Problem 4

Solution

Problem 5

Solution

Problem 6

Solution $\bigtriangleup$

Problem 7

Solution

Problem 8

Solution

Problem 9

Solution

Problem 10

Solution

Problem 11

Let $P(x)$ be a nonzero polynomial such that $(x-1)P(x+1)=(x+2)P(x)$ for every real $x$ , and $\left(P(2)\right)^2 = P(3)$ . Then $P(\tfrac72)=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ .

Solution

Problem 12

Solution

Problem 13

Solution

Problem 14

Solution

Problem 15

Solution

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

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

@@ Line 18: / Line 18: @@
 ==Problem 6==
 [[2016 AIME I Problems/Problem 6 | Solution]]
+<math>\bigtriangleup</math>
 ==Problem 7==

Page

Toolbox

Search

Difference between revisions of "2016 AIME I Problems"

Revision as of 13:27, 4 March 2016

Contents

Problem 1

Problem 2

Problem 3

Problem 4

Problem 5

Problem 6

Problem 7

Problem 8

Problem 9

Problem 10

Problem 11

Problem 12

Problem 13

Problem 14

Problem 15