Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2015 AIME II Problems"

(Problem 13)
m (LaTeXed All Numbers)
Line 65: Line 65:
 
==Problem 10==
 
==Problem 10==
  
−
Call a permutation <math>a_1, a_2, \ldots, a_n</math> of the integers <math>1, 2, \ldots, n</math> ''quasi-increasing'' if <math>a_k \leq a_{k+1} + 2</math> for each <math>1 \leq k \leq n-1</math>. For example, 53421 and 14253 are quasi-increasing permutations of the integers <math>1, 2, 3, 4, 5</math>, but 45123 is not. Find the number of quasi-increasing permutations of the integers <math>1, 2, \ldots, 7</math>.
+
Call a permutation <math>a_1, a_2, \ldots, a_n</math> of the integers <math>1, 2, \ldots, n</math> ''quasi-increasing'' if <math>a_k \leq a_{k+1} + 2</math> for each <math>1 \leq k \leq n-1</math>. For example, <math>53421</math> and <math>14253</math> are quasi-increasing permutations of the integers <math>1, 2, 3, 4, 5</math>, but <math>45123</math> is not. Find the number of quasi-increasing permutations of the integers <math>1, 2, \ldots, 7</math>.
  
 
[[2015 AIME II Problems/Problem 10 | Solution]]
 
[[2015 AIME II Problems/Problem 10 | Solution]]
Line 77: Line 77:
 
==Problem 12==
 
==Problem 12==
  
−
There are <math>2^{10} = 1024</math> possible 10-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than 3 adjacent letters that are identical.
+
There are <math>2^{10} = 1024</math> possible <math>10</math>-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than <math>3</math> adjacent letters that are identical.
  
 
[[2015 AIME II Problems/Problem 12 | Solution]]
 
[[2015 AIME II Problems/Problem 12 | Solution]]

Revision as of 18:53, 26 March 2015

2015 AIME II (Answer Key)
Printable version | AoPS Contest Collections • PDF

Instructions

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

Problem 1

Let $N$ be the least positive integer that is both $22$ percent less than one integer and $16$ percent greater than another integer. Find the remainder when $N$ is divided by $1000$.

Solution

Problem 2

In a new school, $40$ percent of the students are freshmen, $30$ percent are sophomores, $20$ percent are juniors, and $10$ percent are seniors. All freshmen are required to take Latin, and $80$ percent of sophomores, $50$ percent of the juniors, and $20$ percent of the seniors elect to take Latin. The probability that a randomly chosen Latin student is a sophomore is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 3

Let $m$ be the least positive integer divisible by $17$ whose digits sum to $17$. Find $m$.

Solution

Problem 4

In an isosceles trapezoid, the parallel bases have lengths $\log 3$ and $\log 192$, and the altitude to these bases has length $\log 16$. The perimeter of the trapezoid can be written in the form $\log 2^p 3^q$, where $p$ and $q$ are positive integers. Find $p + q$.

Solution

Problem 5

Two unit squares are selected at random without replacement from an $n \times n$ grid of unit squares. Find the least positive integer $n$ such that the probability that the two selected unit squares are horizontally or vertically adjacent is less than $\frac{1}{2015}$.

Solution

Problem 6

Steve says to Jon, "I am thinking of a polynomial whose roots are all positive integers. The polynomial has the form $P(x) = 2x^3-2ax^2+(a^2-81)x-c$ for some positive integers $a$ and $c$. Can you tell me the values of $a$ and $c$?"

After some calculations, Jon says, "There is more than one such polynomial."

Steve says, "You're right. Here is the value of $a$." He writes down a positive integer and asks, "Can you tell me the value of $c$?"

Jon says, "There are still two possible values of $c$."

Find the sum of the two possible values of $c$.

Solution

Problem 7

Triangle $ABC$ has side lengths $AB = 12$, $BC = 25$, and $CA = 17$. Rectangle $PQRS$ has vertex $P$ on $\overline{AB}$, vertex $Q$ on $\overline{AC}$, and vertices $R$ and $S$ on $\overline{BC}$. In terms of the side length $PQ = w$, the area of $PQRS$ can be expressed as the quadratic polynomial

Area($PQRS$) = $\alpha w - \beta \cdot w^2$.

Then the coefficient $\beta = \frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 8

Let $a$ and $b$ be positive integers satisfying $\frac{ab+1}{a+b} < \frac{3}{2}$. The maximum possible value of $\frac{a^3b^3+1}{a^3+b^3}$ is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 9

Problem 10

Call a permutation $a_1, a_2, \ldots, a_n$ of the integers $1, 2, \ldots, n$ quasi-increasing if $a_k \leq a_{k+1} + 2$ for each $1 \leq k \leq n-1$. For example, $53421$ and $14253$ are quasi-increasing permutations of the integers $1, 2, 3, 4, 5$, but $45123$ is not. Find the number of quasi-increasing permutations of the integers $1, 2, \ldots, 7$.

Solution

Problem 11

The circumcircle of acute $\triangle ABC$ has center $O$. The line passing through point $O$ perpendicular to $\overline{OB}$ intersects lines $AB$ and $BC$ and $P$ and $Q$, respectively. Also $AB=5$, $BC=4$, $BQ=4.5$, and $BP=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 12

There are $2^{10} = 1024$ possible $10$-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than $3$ adjacent letters that are identical.

Solution

Problem 13

Define the sequence $a_1, a_2, a_3, \ldots$ by $a_n = \sum\limits_{k=1}^n \sin{k}$, where $k$ represents radian measure. Find the index of the 100th term for which $a_n < 0$.

Solution

Problem 14

Let $x$ and $y$ be real numbers satisfying $x^4y^5+y^4x^5=810$ and $x^3y^6+y^3x^6=945$. Evaluate $2x^3+(xy)^3+2y^3$.

Solution

Problem 15

2015 AIME II (Problems • Answer Key • Resources)
Preceded by
2014 AIME I, 2014 AIME II 		Followed by
2016 AIME
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_AIME_II_Problems&oldid=69548"