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 "2012 AIME I Problems"

(→‎Problem 11)
m
 
(20 intermediate revisions by 8 users not shown)
Line 7: Line 7:
  
 
== Problem 2 ==
 
== Problem 2 ==
−
The terms of an arithmetic sequence add to <math>715</math>. The first term of the sequence is increased by <math>1</math>, the second term is increased by <math>3</math>, the third term is increased by <math>5</math>, and in general, the <math>k</math>th term is increased by the <math>k</math>th odd positive integer. The terms of the new sequence add to <math>836</math>. Find the sum of the first, last, and middle terms of the original sequence.
+
The terms of an arithmetic sequence add to <math>715</math>. The first term of the sequence is increased by <math>1</math>, the second term is increased by <math>3</math>, the third term is increased by <math>5</math>, and in general, the <math>k</math>th term is increased by the <math>k</math>th odd positive integer. The terms of the new sequence add to <math>836</math>. Find the sum of the first, last, and middle term of the original sequence.
  
 
[[2012 AIME I Problems/Problem 2|Solution]]
 
[[2012 AIME I Problems/Problem 2|Solution]]
Line 17: Line 17:
  
 
== Problem 4 ==
 
== Problem 4 ==
−
Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and riding their only horse, Sparky, as follows. Butch begins by walking while Sundance rides. When Sundance reaches the first of the hitching posts that are conveniently located at one-mile intervals along their route, he ties Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky, Butch, and Sundance walk at <math>6</math>, <math>4</math>, and <math>2.5</math> miles per hour, respectively. The first time Butch and Sundance meet at a milepost, they are <math>n</math> miles from Dodge, and they have been traveling for <math>t</math> minutes. Find <math>n + t</math>.
+
Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and riding their only horse, Sparky, as follows. Butch begins by walking while Sundance rides. When Sundance reaches the first of the hitching posts that are conveniently located at one-mile intervals along their route, he ties Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky, Butch, and Sundance walk at <math>6,</math> <math>4,</math> and <math>2.5</math> miles per hour, respectively. The first time Butch and Sundance meet at a milepost, they are <math>n</math> miles from Dodge, and they have been traveling for <math>t</math> minutes. Find <math>n + t</math>.
  
 
[[2012 AIME I Problems/Problem 4|Solution]]
 
[[2012 AIME I Problems/Problem 4|Solution]]
Line 27: Line 27:
  
 
== Problem 6 ==
 
== Problem 6 ==
−
Let <math>z</math> and <math>w</math> be complex numbers such that <math>z^{13} = w</math> and <math>w^{11} = z</math>. If the imaginary part of <math>z</math> can be written as <math> \sin ({\frac{m\pi}{n}})</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>n</math>.
+
The complex numbers <math>z</math> and <math>w</math> satisfy <math>z^{13} = w,</math> <math>w^{11} = z,</math> and the imaginary part of <math>z</math> is <math>\sin{\frac{m\pi}{n}}</math>, for relatively prime positive integers <math>m</math> and <math>n</math> with <math>m<n.</math> Find <math>n.</math>
  
 
[[2012 AIME I Problems/Problem 6|Solution]]
 
[[2012 AIME I Problems/Problem 6|Solution]]
  
 
== Problem 7 ==
 
== Problem 7 ==
 +
At each of the sixteen circles in the network below stands a student. A total of <math>3360</math> coins are distributed among the sixteen students. All at once, all students give away all their coins by passing an equal number of coins to each of their neighbors in the network. After the trade, all students have the same number of coins as they started with. Find the number of coins the student standing at the center circle had originally.
 +
 +
<center><asy>
 +
import cse5;
 +
unitsize(6mm);
 +
defaultpen(linewidth(.8pt));
 +
dotfactor = 8;
 +
pathpen=black;
 +
 +
pair A = (0,0);
 +
pair B = 2*dir(54), C = 2*dir(126), D = 2*dir(198), E = 2*dir(270), F = 2*dir(342);
 +
pair G = 3.6*dir(18), H = 3.6*dir(90), I = 3.6*dir(162), J = 3.6*dir(234), K = 3.6*dir(306);
 +
pair M = 6.4*dir(54), N = 6.4*dir(126), O = 6.4*dir(198), P = 6.4*dir(270), L = 6.4*dir(342);
 +
pair[] dotted = {A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P};
 +
 +
D(A--B--H--M);
 +
D(A--C--H--N);
 +
D(A--F--G--L);
 +
D(A--E--K--P);
 +
D(A--D--J--O);
 +
D(B--G--M);
 +
D(F--K--L);
 +
D(E--J--P);
 +
D(O--I--D);
 +
D(C--I--N);
 +
D(L--M--N--O--P--L);
 +
 +
dot(dotted);
 +
 +
</asy></center>
 +
 
[[2012 AIME I Problems/Problem 7|Solution]]
 
[[2012 AIME I Problems/Problem 7|Solution]]
  
 
== Problem 8 ==
 
== Problem 8 ==
 +
Cube <math>ABCDEFGH,</math> labeled as shown below, has edge length <math>1</math> and is cut by a plane passing through vertex <math>D</math> and the midpoints <math>M</math> and <math>N</math> of <math>\overline{AB}</math> and <math>\overline{CG}</math> respectively. The plane divides the cube into two solids. The volume of the larger of the two solids can be written in the form <math>\tfrac{p}{q},</math> where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q.</math>
 +
 +
<center><asy>import cse5;
 +
unitsize(10mm);
 +
pathpen=black;
 +
dotfactor=3;
 +
 +
pair A = (0,0), B = (3.8,0), C = (5.876,1.564), D = (2.076,1.564), E = (0,3.8), F = (3.8,3.8), G = (5.876,5.364), H = (2.076,5.364), M = (1.9,0), N = (5.876,3.465);
 +
pair[] dotted = {A,B,C,D,E,F,G,H,M,N};
 +
 +
D(A--B--C--G--H--E--A);
 +
D(E--F--B);
 +
D(F--G);
 +
pathpen=dashed;
 +
D(A--D--H);
 +
D(D--C);
 +
 +
dot(dotted);
 +
label("$A$",A,SW);
 +
label("$B$",B,S);
 +
label("$C$",C,SE);
 +
label("$D$",D,NW);
 +
label("$E$",E,W);
 +
label("$F$",F,SE);
 +
label("$G$",G,NE);
 +
label("$H$",H,NW);
 +
label("$M$",M,S);
 +
label("$N$",N,NE);
 +
 +
</asy></center>
 +
 
[[2012 AIME I Problems/Problem 8|Solution]]
 
[[2012 AIME I Problems/Problem 8|Solution]]
  
Line 50: Line 112:
  
 
== Problem 11 ==
 
== Problem 11 ==
−
A frog begins at <math>P_0 = (0,0)</math> and makes a sequence of jumps according to the following rule: from <math>P_n = (x_n, y_n),</math> the frog jumps to <math>P_{n+1},</math> which may be any of the points <math>(x_n + 7, y_n + 2),</math> <math>(x_n + 2, y_n + 7),</math> <math>(x_n - 5, y_n - 10),</math> or <math>(x_n - 10, y_n - 5).</math> There are <math>M</math> points <math>(x, y)</math> with <math>\abs{x} + \abs{y} \le 100</math> that can be reached by a sequence of such jumps. Find the remainder when <math>M</math> is divided by <math>1000.</math>
+
A frog begins at <math>P_0 = (0,0)</math> and makes a sequence of jumps according to the following rule: from <math>P_n = (x_n, y_n),</math> the frog jumps to <math>P_{n+1},</math> which may be any of the points <math>(x_n + 7, y_n + 2),</math> <math>(x_n + 2, y_n + 7),</math> <math>(x_n - 5, y_n - 10),</math> or <math>(x_n - 10, y_n - 5).</math> There are <math>M</math> points <math>(x, y)</math> with <math>|x| + |y| \le 100</math> that can be reached by a sequence of such jumps. Find the remainder when <math>M</math> is divided by <math>1000.</math>
  
 
[[2012 AIME I Problems/Problem 11|Solution]]
 
[[2012 AIME I Problems/Problem 11|Solution]]
  
 
== Problem 12 ==
 
== Problem 12 ==
 +
Let <math>\triangle ABC</math> be a right triangle with right angle at <math>C.</math> Let <math>D</math> and <math>E</math> be points on <math>\overline{AB}</math> with <math>D</math> between <math>A</math> and <math>E</math> such that <math>\overline{CD}</math> and <math>\overline{CE}</math> trisect <math>\angle C.</math> If <math>\frac{DE}{BE} = \frac{8}{15},</math> then <math>\tan B</math> can be written as <math>\frac{m \sqrt{p}}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, and <math>p</math> is a positive integer not divisible by the square of any prime. Find <math>m+n+p.</math>
 +
 
[[2012 AIME I Problems/Problem 12|Solution]]
 
[[2012 AIME I Problems/Problem 12|Solution]]
  
 
== Problem 13 ==
 
== Problem 13 ==
 +
Three concentric circles have radii <math>3,</math> <math>4,</math> and <math>5.</math> An equilateral triangle with one vertex on each circle has side length <math>s.</math> The largest possible area of the triangle can be written as <math>a + \tfrac{b}{c} \sqrt{d},</math> where <math>a,</math> <math>b,</math> <math>c,</math> and <math>d</math> are positive integers, <math>b</math> and <math>c</math> are relatively prime, and <math>d</math> is not divisible by the square of any prime. Find <math>a+b+c+d.</math>
 +
 
[[2012 AIME I Problems/Problem 13|Solution]]
 
[[2012 AIME I Problems/Problem 13|Solution]]
  
 
== Problem 14 ==
 
== Problem 14 ==
 +
Complex numbers <math>a,</math> <math>b,</math> and <math>c</math> are zeros of a polynomial <math>P(z) = z^3 + qz + r,</math> and <math>|a|^2 + |b|^2 + |c|^2 = 250.</math> The points corresponding to <math>a,</math> <math>b,</math> and <math>c</math> in the complex plane are the vertices of a right triangle with hypotenuse <math>h.</math> Find <math>h^2.</math>
 +
 
[[2012 AIME I Problems/Problem 14|Solution]]
 
[[2012 AIME I Problems/Problem 14|Solution]]
  
 
== Problem 15 ==
 
== Problem 15 ==
 +
There are <math>n</math> mathematicians seated around a circular table with <math>n</math> seats numbered <math>1,</math> <math>2,</math> <math>3,</math> <math>...,</math> <math>n</math> in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer <math>a</math> such that
 +
 +
<UL>
 +
(<math>1</math>) for each <math>k,</math> the mathematician who was seated in seat <math>k</math> before the break is seated in seat <math>ka</math> after the break (where seat <math>i + n</math> is seat <math>i</math>);
 +
</UL>
 +
 +
<UL>
 +
(<math>2</math>) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break.
 +
</UL>
 +
 +
Find the number of possible values of <math>n</math> with <math>1 < n < 1000.</math>
 +
 
[[2012 AIME I Problems/Problem 15|Solution]]
 
[[2012 AIME I Problems/Problem 15|Solution]]
  
 
== See also ==
 
== See also ==
 +
 +
{{AIME box|year=2012|n=I|before=[[2011 AIME II Problems]]|after=[[2012 AIME II Problems]]}}
 +
 
* [[American Invitational Mathematics Examination]]
 
* [[American Invitational Mathematics Examination]]
 
* [[AIME Problems and Solutions]]
 
* [[AIME Problems and Solutions]]
 
* [[Mathematics competition resources]]
 
* [[Mathematics competition resources]]
 +
{{MAA Notice}}

Latest revision as of 13:49, 2 June 2023

2012 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 $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

Find the number of positive integers with three not necessarily distinct digits, $abc$, with $a \neq 0$ and $c \neq 0$ such that both $abc$ and $cba$ are multiples of $4$.

Solution

Problem 2

The terms of an arithmetic sequence add to $715$. The first term of the sequence is increased by $1$, the second term is increased by $3$, the third term is increased by $5$, and in general, the $k$th term is increased by the $k$th odd positive integer. The terms of the new sequence add to $836$. Find the sum of the first, last, and middle term of the original sequence.

Solution

Problem 3

Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people so that exactly one person receives the type of meal ordered by that person.

Solution

Problem 4

Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and riding their only horse, Sparky, as follows. Butch begins by walking while Sundance rides. When Sundance reaches the first of the hitching posts that are conveniently located at one-mile intervals along their route, he ties Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky, Butch, and Sundance walk at $6,$ $4,$ and $2.5$ miles per hour, respectively. The first time Butch and Sundance meet at a milepost, they are $n$ miles from Dodge, and they have been traveling for $t$ minutes. Find $n + t$.

Solution

Problem 5

Let $B$ be the set of all binary integers that can be written using exactly $5$ zeros and $8$ ones where leading zeros are allowed. If all possible subtractions are performed in which one element of $B$ is subtracted from another, find the number of times the answer $1$ is obtained.

Solution

Problem 6

The complex numbers $z$ and $w$ satisfy $z^{13} = w,$ $w^{11} = z,$ and the imaginary part of $z$ is $\sin{\frac{m\pi}{n}}$, for relatively prime positive integers $m$ and $n$ with $m<n.$ Find $n.$

Solution

Problem 7

At each of the sixteen circles in the network below stands a student. A total of $3360$ coins are distributed among the sixteen students. All at once, all students give away all their coins by passing an equal number of coins to each of their neighbors in the network. After the trade, all students have the same number of coins as they started with. Find the number of coins the student standing at the center circle had originally.

[asy] import cse5; unitsize(6mm); defaultpen(linewidth(.8pt)); dotfactor = 8; pathpen=black; pair A = (0,0); pair B = 2*dir(54), C = 2*dir(126), D = 2*dir(198), E = 2*dir(270), F = 2*dir(342); pair G = 3.6*dir(18), H = 3.6*dir(90), I = 3.6*dir(162), J = 3.6*dir(234), K = 3.6*dir(306); pair M = 6.4*dir(54), N = 6.4*dir(126), O = 6.4*dir(198), P = 6.4*dir(270), L = 6.4*dir(342); pair[] dotted = {A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P}; D(A--B--H--M); D(A--C--H--N); D(A--F--G--L); D(A--E--K--P); D(A--D--J--O); D(B--G--M); D(F--K--L); D(E--J--P); D(O--I--D); D(C--I--N); D(L--M--N--O--P--L); dot(dotted); [/asy]

Solution

Problem 8

Cube $ABCDEFGH,$ labeled as shown below, has edge length $1$ and is cut by a plane passing through vertex $D$ and the midpoints $M$ and $N$ of $\overline{AB}$ and $\overline{CG}$ respectively. The plane divides the cube into two solids. The volume of the larger of the two solids can be written in the form $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$

[asy]import cse5; unitsize(10mm); pathpen=black; dotfactor=3; pair A = (0,0), B = (3.8,0), C = (5.876,1.564), D = (2.076,1.564), E = (0,3.8), F = (3.8,3.8), G = (5.876,5.364), H = (2.076,5.364), M = (1.9,0), N = (5.876,3.465); pair[] dotted = {A,B,C,D,E,F,G,H,M,N}; D(A--B--C--G--H--E--A); D(E--F--B); D(F--G); pathpen=dashed; D(A--D--H); D(D--C); dot(dotted); label("$A$",A,SW); label("$B$",B,S); label("$C$",C,SE); label("$D$",D,NW); label("$E$",E,W); label("$F$",F,SE); label("$G$",G,NE); label("$H$",H,NW); label("$M$",M,S); label("$N$",N,NE); [/asy]

Solution

Problem 9

Let $x,$ $y,$ and $z$ be positive real numbers that satisfy \[2\log_{x}(2y) = 2\log_{2x}(4z) = \log_{2x^4}(8yz) \ne 0.\] The value of $xy^5z$ can be expressed in the form $\frac{1}{2^{p/q}},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$

Solution

Problem 10

Let $\mathcal{S}$ be the set of all perfect squares whose rightmost three digits in base $10$ are $256$. Let $\mathcal{T}$ be the set of all numbers of the form $\frac{x-256}{1000}$, where $x$ is in $\mathcal{S}$. In other words, $\mathcal{T}$ is the set of numbers that result when the last three digits of each number in $\mathcal{S}$ are truncated. Find the remainder when the tenth smallest element of $\mathcal{T}$ is divided by $1000$.

Solution

Problem 11

A frog begins at $P_0 = (0,0)$ and makes a sequence of jumps according to the following rule: from $P_n = (x_n, y_n),$ the frog jumps to $P_{n+1},$ which may be any of the points $(x_n + 7, y_n + 2),$ $(x_n + 2, y_n + 7),$ $(x_n - 5, y_n - 10),$ or $(x_n - 10, y_n - 5).$ There are $M$ points $(x, y)$ with $|x| + |y| \le 100$ that can be reached by a sequence of such jumps. Find the remainder when $M$ is divided by $1000.$

Solution

Problem 12

Let $\triangle ABC$ be a right triangle with right angle at $C.$ Let $D$ and $E$ be points on $\overline{AB}$ with $D$ between $A$ and $E$ such that $\overline{CD}$ and $\overline{CE}$ trisect $\angle C.$ If $\frac{DE}{BE} = \frac{8}{15},$ then $\tan B$ can be written as $\frac{m \sqrt{p}}{n},$ where $m$ and $n$ are relatively prime positive integers, and $p$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$

Solution

Problem 13

Three concentric circles have radii $3,$ $4,$ and $5.$ An equilateral triangle with one vertex on each circle has side length $s.$ The largest possible area of the triangle can be written as $a + \tfrac{b}{c} \sqrt{d},$ where $a,$ $b,$ $c,$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d.$

Solution

Problem 14

Complex numbers $a,$ $b,$ and $c$ are zeros of a polynomial $P(z) = z^3 + qz + r,$ and $|a|^2 + |b|^2 + |c|^2 = 250.$ The points corresponding to $a,$ $b,$ and $c$ in the complex plane are the vertices of a right triangle with hypotenuse $h.$ Find $h^2.$

Solution

Problem 15

There are $n$ mathematicians seated around a circular table with $n$ seats numbered $1,$ $2,$ $3,$ $...,$ $n$ in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer $a$ such that

    ($1$) for each $k,$ the mathematician who was seated in seat $k$ before the break is seated in seat $ka$ after the break (where seat $i + n$ is seat $i$);
    ($2$) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break.

Find the number of possible values of $n$ with $1 < n < 1000.$

Solution

See also

2012 AIME I (Problems • Answer Key • Resources)
Preceded by
2011 AIME II Problems 		Followed by
2012 AIME II Problems
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=2012_AIME_I_Problems&oldid=193818"