Difference between revisions of "2007 AIME II Problems"
(→See also: this box shouldn't be on the general problems page) |
(→Problem 10) |
||
(21 intermediate revisions by 17 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{AIME Problems|year=2007|n=II}} | ||
+ | |||
== Problem 1 == | == Problem 1 == | ||
− | A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in <math>2007</math>. No character may appear in a | + | A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in <math>2007</math>. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in <math>2007</math>. A set of plates in which each possible sequence appears exactly once contains N license plates. Find N/10. |
[[2007 AIME II Problems/Problem 1|Solution]] | [[2007 AIME II Problems/Problem 1|Solution]] | ||
== Problem 2 == | == Problem 2 == | ||
− | Find the number of ordered | + | Find the number of ordered triples <math>(a,b,c)</math> where <math>a</math>, <math>b</math>, and <math>c</math> are positive [[integer]]s, <math>a</math> is a [[factor]] of <math>b</math>, <math>a</math> is a factor of <math>c</math>, and <math>a+b+c=100</math>. |
[[2007 AIME II Problems/Problem 2|Solution]] | [[2007 AIME II Problems/Problem 2|Solution]] | ||
== Problem 3 == | == Problem 3 == | ||
− | [[Square]] <math>ABCD</math> has side length <math>13</math>, and [[point]]s <math>E</math> and <math>F</math> are exterior to the square such that <math>BE=DF=5</math> and <math>AE=CF=12</math>. Find <math> | + | [[Square]] <math>ABCD</math> has side length <math>13</math>, and [[point]]s <math>E</math> and <math>F</math> are exterior to the square such that <math>BE=DF=5</math> and <math>AE=CF=12</math>. Find <math>EF^{2}</math>. |
<div style="text-align:center;">[[Image:2007 AIME II-3.png]]</div> | <div style="text-align:center;">[[Image:2007 AIME II-3.png]]</div> | ||
Line 17: | Line 19: | ||
== Problem 4 == | == Problem 4 == | ||
− | The workers in a factory produce widgets and whoosits. For each product, production time is [[constant]] and identical for all workers, but not necessarily equal for the two products. In one hour, <math>100</math> workers can produce <math>300</math> widgets and <math>200</math> whoosits. In two hours, <math>60</math> workers can produce <math>240</math> widgets and <math>300</math> whoosits. In three hours, <math>50</math> workers can produce <math>150</math> widgets and <math>m</math> whoosits. Find <math> | + | The workers in a factory produce widgets and whoosits. For each product, production time is [[constant]] and identical for all workers, but not necessarily equal for the two products. In one hour, <math>100</math> workers can produce <math>300</math> widgets and <math>200</math> whoosits. In two hours, <math>60</math> workers can produce <math>240</math> widgets and <math>300</math> whoosits. In three hours, <math>50</math> workers can produce <math>150</math> widgets and <math>m</math> whoosits. Find <math>m</math>. |
[[2007 AIME II Problems/Problem 4|Solution]] | [[2007 AIME II Problems/Problem 4|Solution]] | ||
Line 27: | Line 29: | ||
== Problem 6 == | == Problem 6 == | ||
− | An integer is called ''parity-monotonic'' if its decimal representation <math>a_{1}a_{2}a_{3}\cdots a_{k}</math> satisfies <math>a_{i}<a_{i+1}</math> if <math>a_{i}</math> is [[odd]], and <math>a_{i}>a_{i+1}</math> if <math>a_{i}</math> is [[even]]. How many four-digit parity-monotonic integers are there? | + | An integer is called ''parity-monotonic'' if its decimal representation <math>a_{1}a_{2}a_{3}\cdots a_{k}</math> satisfies <math>a_{i}<a_{i+1}</math> if <math>a_{i}</math> is [[odd]], and <math>a_{i}>a_{i+1}</math> if <math>a_{i}</math> is [[even]]. How many four-digit parity-monotonic integers are there? |
[[2007 AIME II Problems/Problem 6|Solution]] | [[2007 AIME II Problems/Problem 6|Solution]] | ||
== Problem 7 == | == Problem 7 == | ||
− | Given a [[real number]] <math>x,</math> let <math>\lfloor x \rfloor</math> denote the [[floor function|greatest integer]] less than or equal to <math>x.</math> For a certain [[integer]] <math>k,</math> there are exactly <math>70</math> positive integers <math>n_{1}, n_{2}, \ldots, n_{70}</math> such that <math>k=\lfloor\sqrt[3]{n_{1}}\rfloor = \lfloor\sqrt[3]{n_{ | + | Given a [[real number]] <math>x,</math> let <math>\lfloor x \rfloor</math> denote the [[floor function|greatest integer]] less than or equal to <math>x.</math> For a certain [[integer]] <math>k,</math> there are exactly <math>70</math> positive integers <math>n_{1}, n_{2}, \ldots, n_{70}</math> such that <math>k=\lfloor\sqrt[3]{n_{1}}\rfloor = \lfloor\sqrt[3]{n_{2}}\rfloor = \cdots = \lfloor\sqrt[3]{n_{70}}\rfloor</math> and <math>k</math> divides <math>n_{i}</math> for all <math>i</math> such that <math>1 \leq i \leq 70.</math> |
Find the maximum value of <math>\frac{n_{i}}{k}</math> for <math>1\leq i \leq 70.</math> | Find the maximum value of <math>\frac{n_{i}}{k}</math> for <math>1\leq i \leq 70.</math> | ||
Line 54: | Line 56: | ||
== Problem 10 == | == Problem 10 == | ||
− | Let <math>S</math> be a [[set]] with six [[element]]s. Let <math>P</math> be the set of all [[subset]]s of <math>S.</math> Subsets <math>A</math> and <math>B</math> of <math>S</math>, not necessarily distinct, are chosen independently and at random from <math>P</math>. The [[probability]] that <math>B</math> is contained in | + | Let <math>S</math> be a [[set]] with six [[element]]s. Let <math>\mathcal{P}</math> be the set of all [[subset]]s of <math>S.</math> Subsets <math>A</math> and <math>B</math> of <math>S</math>, not necessarily distinct, are chosen independently and at random from <math>\mathcal{P}</math>. The [[probability]] that <math>B</math> is contained in one of <math>A</math> or <math>S-A</math> is <math>\frac{m}{n^{r}},</math> where <math>m</math>, <math>n</math>, and <math>r</math> are [[positive]] [[integer]]s, <math>n</math> is [[prime]], and <math>m</math> and <math>n</math> are [[relatively prime]]. Find <math>m+n+r.</math> (The set <math>S-A</math> is the set of all elements of <math>S</math> which are not in <math>A.</math>) |
[[2007 AIME II Problems/Problem 10|Solution]] | [[2007 AIME II Problems/Problem 10|Solution]] | ||
Line 68: | Line 70: | ||
<math>\sum_{n=0}^{7}\log_{3}(x_{n}) = 308</math> and <math>56 \leq \log_{3}\left ( \sum_{n=0}^{7}x_{n}\right ) \leq 57,</math> | <math>\sum_{n=0}^{7}\log_{3}(x_{n}) = 308</math> and <math>56 \leq \log_{3}\left ( \sum_{n=0}^{7}x_{n}\right ) \leq 57,</math> | ||
− | find <math> | + | find <math>\log_{3}(x_{14}).</math> |
[[2007 AIME II Problems/Problem 12|Solution]] | [[2007 AIME II Problems/Problem 12|Solution]] | ||
Line 75: | Line 77: | ||
A [[triangle|triangular]] [[array]] of [[square]]s has one square in the first row, two in the second, and in general, <math>k</math> squares in the <math>k</math>th row for <math>1 \leq k \leq 11.</math> With the exception of the bottom row, each square rests on two squares in the row immediately below (illustrated in given diagram). In each square of the eleventh row, a <math>0</math> or a <math>1</math> is placed. Numbers are then placed into the other squares, with the entry for each square being the sum of the entries in the two squares below it. For how many initial distributions of <math>0</math>'s and <math>1</math>'s in the bottom row is the number in the top square a [[multiple]] of <math>3</math>? | A [[triangle|triangular]] [[array]] of [[square]]s has one square in the first row, two in the second, and in general, <math>k</math> squares in the <math>k</math>th row for <math>1 \leq k \leq 11.</math> With the exception of the bottom row, each square rests on two squares in the row immediately below (illustrated in given diagram). In each square of the eleventh row, a <math>0</math> or a <math>1</math> is placed. Numbers are then placed into the other squares, with the entry for each square being the sum of the entries in the two squares below it. For how many initial distributions of <math>0</math>'s and <math>1</math>'s in the bottom row is the number in the top square a [[multiple]] of <math>3</math>? | ||
− | + | <asy> | |
+ | for (int i=0; i<12; ++i){ | ||
+ | for (int j=0; j<i; ++j){ | ||
+ | //dot((-j+i/2,-i)); | ||
+ | draw((-j+i/2,-i)--(-j+i/2+1,-i)--(-j+i/2+1,-i+1)--(-j+i/2,-i+1)--cycle); | ||
+ | } | ||
+ | } | ||
+ | </asy> | ||
[[2007 AIME II Problems/Problem 13|Solution]] | [[2007 AIME II Problems/Problem 13|Solution]] | ||
== Problem 14 == | == Problem 14 == | ||
− | Let <math>f(x)</math> be a [[polynomial]] with real [[coefficient]]s such that <math> | + | Let <math>f(x)</math> be a [[polynomial]] with real [[coefficient]]s such that <math>f(0) = 1,</math> <math>f(2)+f(3)=125,</math> and for all <math>x</math>, <math>f(x)f(2x^{2})=f(2x^{3}+x).</math> Find <math>f(5).</math> |
[[2007 AIME II Problems/Problem 14|Solution]] | [[2007 AIME II Problems/Problem 14|Solution]] | ||
Line 88: | Line 97: | ||
[[2007 AIME II Problems/Problem 15|Solution]] | [[2007 AIME II Problems/Problem 15|Solution]] | ||
+ | |||
+ | {{AIME box|year=2007|n=II|before=[[2007 AIME I]]|after=[[2008 AIME I]]}} | ||
+ | {{MAA Notice}} |
Latest revision as of 01:45, 6 December 2021
2007 AIME II (Answer Key) | AoPS Contest Collections • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in . No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in . A set of plates in which each possible sequence appears exactly once contains N license plates. Find N/10.
Problem 2
Find the number of ordered triples where , , and are positive integers, is a factor of , is a factor of , and .
Problem 3
Square has side length , and points and are exterior to the square such that and . Find .
Problem 4
The workers in a factory produce widgets and whoosits. For each product, production time is constant and identical for all workers, but not necessarily equal for the two products. In one hour, workers can produce widgets and whoosits. In two hours, workers can produce widgets and whoosits. In three hours, workers can produce widgets and whoosits. Find .
Problem 5
The graph of the equation is drawn on graph paper with each square representing one unit in each direction. How many of the by graph paper squares have interiors lying entirely below the graph and entirely in the first quadrant?
Problem 6
An integer is called parity-monotonic if its decimal representation satisfies if is odd, and if is even. How many four-digit parity-monotonic integers are there?
Problem 7
Given a real number let denote the greatest integer less than or equal to For a certain integer there are exactly positive integers such that and divides for all such that
Find the maximum value of for
Problem 8
A rectangular piece of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called basic if
- (i) all four sides of the rectangle are segments of drawn line segments, and
- (ii) no segments of drawn lines lie inside the rectangle.
Given that the total length of all lines drawn is exactly 2007 units, let be the maximum possible number of basic rectangles determined. Find the remainder when is divided by 1000.
Problem 9
Rectangle is given with and Points and lie on and respectively, such that The inscribed circle of triangle is tangent to at point and the inscribed circle of triangle is tangent to at point Find
Problem 10
Let be a set with six elements. Let be the set of all subsets of Subsets and of , not necessarily distinct, are chosen independently and at random from . The probability that is contained in one of or is where , , and are positive integers, is prime, and and are relatively prime. Find (The set is the set of all elements of which are not in )
Problem 11
Two long cylindrical tubes of the same length but different diameters lie parallel to each other on a flat surface. The larger tube has radius and rolls along the surface toward the smaller tube, which has radius . It rolls over the smaller tube and continues rolling along the flat surface until it comes to rest on the same point of its circumference as it started, having made one complete revolution. If the smaller tube never moves, and the rolling occurs with no slipping, the larger tube ends up a distance from where it starts. The distance can be expressed in the form where and are integers and is not divisible by the square of any prime. Find
Problem 12
The increasing geometric sequence consists entirely of integral powers of Given that
and
find
Problem 13
A triangular array of squares has one square in the first row, two in the second, and in general, squares in the th row for With the exception of the bottom row, each square rests on two squares in the row immediately below (illustrated in given diagram). In each square of the eleventh row, a or a is placed. Numbers are then placed into the other squares, with the entry for each square being the sum of the entries in the two squares below it. For how many initial distributions of 's and 's in the bottom row is the number in the top square a multiple of ?
Problem 14
Let be a polynomial with real coefficients such that and for all , Find
Problem 15
Four circles and with the same radius are drawn in the interior of triangle such that is tangent to sides and , to and , to and , and is externally tangent to and . If the sides of triangle are and the radius of can be represented in the form , where and are relatively prime positive integers. Find
2007 AIME II (Problems • Answer Key • Resources) | ||
Preceded by 2007 AIME I |
Followed by 2008 AIME I | |
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.