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 "2006 AIME II Problems"

(→‎Problem 1)
Line 8: Line 8:
 
The lengths of the sides of a triangle with positive area are <math>\log_{10} 12</math>, <math>\log_{10} 75</math>, and <math>\log_{10} n</math>, where <math>n</math> is a positive integer. Find the number of possible values for <math>n</math>.
 
The lengths of the sides of a triangle with positive area are <math>\log_{10} 12</math>, <math>\log_{10} 75</math>, and <math>\log_{10} n</math>, where <math>n</math> is a positive integer. Find the number of possible values for <math>n</math>.
  
−
[[2006 AIME I Problems/Problem 2|Solution]]
+
[[2006 AIME II Problems/Problem 2|Solution]]
  
 
== Problem 3 ==
 
== Problem 3 ==
 
Let <math> P </math> be the product of the first 100 positive odd integers. Find the largest integer <math> k </math> such that <math> P </math> is divisible by <math> 3^k </math>
 
Let <math> P </math> be the product of the first 100 positive odd integers. Find the largest integer <math> k </math> such that <math> P </math> is divisible by <math> 3^k </math>
  
−
[[2006 AIME I Problems/Problem 3|Solution]]
+
[[2006 AIME II Problems/Problem 3|Solution]]
  
 
== Problem 4 ==
 
== Problem 4 ==
Line 23: Line 23:
 
An example of such a permutation is <math> (6,5,4,3,2,1,7,8,9,10,11,12). </math> Find the number of such permutations.
 
An example of such a permutation is <math> (6,5,4,3,2,1,7,8,9,10,11,12). </math> Find the number of such permutations.
  
−
[[2006 AIME I Problems/Problem 4|Solution]]
+
[[2006 AIME II Problems/Problem 4|Solution]]
  
 
== Problem 5 ==
 
== Problem 5 ==
Line 29: Line 29:
  
  
−
[[2006 AIME I Problems/Problem 5|Solution]]
+
[[2006 AIME II Problems/Problem 5|Solution]]
  
 
== Problem 6 ==
 
== Problem 6 ==
 
Square <math> ABCD </math> has sides of length 1. Points <math> E </math> and <math> F </math> are on <math> \overline{BC} </math> and <math> \overline{CD}, </math> respectively, so that <math> \triangle AEF </math> is equilateral. A square with vertex <math> B </math> has sides that are parallel to those of <math> ABCD </math> and a vertex on <math> \overline{AE}. </math> The length of a side of this smaller square is <math>\frac{a-\sqrt{b}}{c}, </math> where <math> a, b, </math> and <math> c </math> are positive integers and <math> b</math> is not divisible by the square of any prime. Find <math> a+b+c. </math>
 
Square <math> ABCD </math> has sides of length 1. Points <math> E </math> and <math> F </math> are on <math> \overline{BC} </math> and <math> \overline{CD}, </math> respectively, so that <math> \triangle AEF </math> is equilateral. A square with vertex <math> B </math> has sides that are parallel to those of <math> ABCD </math> and a vertex on <math> \overline{AE}. </math> The length of a side of this smaller square is <math>\frac{a-\sqrt{b}}{c}, </math> where <math> a, b, </math> and <math> c </math> are positive integers and <math> b</math> is not divisible by the square of any prime. Find <math> a+b+c. </math>
  
−
[[2006 AIME I Problems/Problem 6|Solution]]
+
[[2006 AIME II Problems/Problem 6|Solution]]
  
 
== Problem 7 ==
 
== Problem 7 ==
 
Find the number of ordered pairs of positive integers <math> (a,b) </math> such that <math> a+b=1000 </math> and neither <math> a </math> nor <math> b </math> has a zero digit.
 
Find the number of ordered pairs of positive integers <math> (a,b) </math> such that <math> a+b=1000 </math> and neither <math> a </math> nor <math> b </math> has a zero digit.
  
−
[[2006 AIME I Problems/Problem 7|Solution]]
+
[[2006 AIME II Problems/Problem 7|Solution]]
  
 
== Problem 8 ==
 
== Problem 8 ==
Line 46: Line 46:
 
Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles may be formed?
 
Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles may be formed?
  
−
[[2006 AIME I Problems/Problem 8|Solution]]
+
[[2006 AIME II Problems/Problem 8|Solution]]
  
 
== Problem 9 ==
 
== Problem 9 ==
 
Circles <math> \mathcal{C}_1, \mathcal{C}_2, </math> and <math> \mathcal{C}_3 </math> have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line <math> t_1 </math> is a common internal tangent to <math>\mathcal{C}_1</math> and <math>\mathcal{C}_2</math> and has a positive slope, and line <math>t_2</math> is a common internal tangent to <math>\mathcal{C}_2</math> and <math>\mathcal{C}_3</math> and has a negative slope. Given that lines <math>t_1</math> and <math>t_2</math> intersect at <math>(x,y),</math> and that <math>x=p-q\sqrt{r},</math> where <math>p, q,</math> and <math>r</math> are positive integers and <math>r</math> is not divisible by the square of any prime, find <math>p+q+r.</math>
 
Circles <math> \mathcal{C}_1, \mathcal{C}_2, </math> and <math> \mathcal{C}_3 </math> have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line <math> t_1 </math> is a common internal tangent to <math>\mathcal{C}_1</math> and <math>\mathcal{C}_2</math> and has a positive slope, and line <math>t_2</math> is a common internal tangent to <math>\mathcal{C}_2</math> and <math>\mathcal{C}_3</math> and has a negative slope. Given that lines <math>t_1</math> and <math>t_2</math> intersect at <math>(x,y),</math> and that <math>x=p-q\sqrt{r},</math> where <math>p, q,</math> and <math>r</math> are positive integers and <math>r</math> is not divisible by the square of any prime, find <math>p+q+r.</math>
  
−
[[2006 AIME I Problems/Problem 9|Solution]]
+
[[2006 AIME II Problems/Problem 9|Solution]]
  
 
== Problem 10 ==
 
== Problem 10 ==
Line 57: Line 57:
  
  
−
[[2006 AIME I Problems/Problem 10|Solution]]
+
[[2006 AIME II Problems/Problem 10|Solution]]
  
 
== Problem 11 ==
 
== Problem 11 ==
 
A sequence is defined as follows <math> a_1=a_2=a_3=1, </math> and, for all positive integers <math> n, a_{n+3}=a_{n+2}+a_{n+1}+a_n. </math> Given that <math> a_{28}=6090307, a_{29}=11201821, </math> and <math> a_{30}=20603361, </math> find the remainder when <math>\sum^{28}_{k=1} a_k </math> is divided by 1000.
 
A sequence is defined as follows <math> a_1=a_2=a_3=1, </math> and, for all positive integers <math> n, a_{n+3}=a_{n+2}+a_{n+1}+a_n. </math> Given that <math> a_{28}=6090307, a_{29}=11201821, </math> and <math> a_{30}=20603361, </math> find the remainder when <math>\sum^{28}_{k=1} a_k </math> is divided by 1000.
  
−
[[2006 AIME I Problems/Problem 11|Solution]]
+
[[2006 AIME II Problems/Problem 11|Solution]]
  
 
== Problem 12 ==
 
== Problem 12 ==
Line 69: Line 69:
 
{{image needed}}
 
{{image needed}}
  
−
[[2006 AIME I Problems/Problem 12|Solution]]
+
[[2006 AIME II Problems/Problem 12|Solution]]
  
 
== Problem 13 ==
 
== Problem 13 ==
 
How many integers <math> N </math> less than 1000 can be written as the sum of <math> j </math> consecutive positive odd integers from exactly 5 values of <math> j\ge 1. </math>
 
How many integers <math> N </math> less than 1000 can be written as the sum of <math> j </math> consecutive positive odd integers from exactly 5 values of <math> j\ge 1. </math>
  
−
[[2006 AIME I Problems/Problem 13|Solution]]
+
[[2006 AIME II Problems/Problem 13|Solution]]
  
 
== Problem 14 ==
 
== Problem 14 ==
 
Let <math> S_n </math> be the sum of the reciprocals of the non-zero digits of the integers from 1 to <math> 10^n </math> inclusive. Find the smallest positive integer n for which <math> S_n </math> is an integer.
 
Let <math> S_n </math> be the sum of the reciprocals of the non-zero digits of the integers from 1 to <math> 10^n </math> inclusive. Find the smallest positive integer n for which <math> S_n </math> is an integer.
  
−
[[2006 AIME I Problems/Problem 14|Solution]]
+
[[2006 AIME II Problems/Problem 14|Solution]]
  
 
== Problem 15 ==
 
== Problem 15 ==

Revision as of 09:07, 13 November 2007

Problem 1

In convex hexagon $ABCDEF$, all six sides are congruent, $\angle A$ and $\angle D$ are right angles, and $\angle B, \angle C, \angle E,$ and $\angle F$ are congruent. The area of the hexagonal region is $2116(\sqrt{2}+1).$ Find $AB$.

Solution

Problem 2

The lengths of the sides of a triangle with positive area are $\log_{10} 12$, $\log_{10} 75$, and $\log_{10} n$, where $n$ is a positive integer. Find the number of possible values for $n$.

Solution

Problem 3

Let $P$ be the product of the first 100 positive odd integers. Find the largest integer $k$ such that $P$ is divisible by $3^k$

Solution

Problem 4

Let $(a_1,a_2,a_3,\ldots,a_{12})$ be a permutation of $(1,2,3,\ldots,12)$ for which

$a_1>a_2>a_3>a_4>a_5>a_6 \mathrm{\ and \ } a_6<a_7<a_8<a_9<a_{10}<a_{11}<a_{12}.$

An example of such a permutation is $(6,5,4,3,2,1,7,8,9,10,11,12).$ Find the number of such permutations.

Solution

Problem 5

When rolling a certain unfair six-sided die with faces numbered 1, 2, 3, 4, 5, and 6, the probability of obtaining face $F$ is greater than 1/6, the probability of obtaining the face opposite is less than 1/6, the probability of obtaining any one of the other four faces is 1/6, and the sum of the numbers on opposite faces is 7. When two such dice are rolled, the probability of obtaining a sum of 7 is 47/288. Given that the probability of obtaining face $F$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$


Solution

Problem 6

Square $ABCD$ has sides of length 1. Points $E$ and $F$ are on $\overline{BC}$ and $\overline{CD},$ respectively, so that $\triangle AEF$ is equilateral. A square with vertex $B$ has sides that are parallel to those of $ABCD$ and a vertex on $\overline{AE}.$ The length of a side of this smaller square is $\frac{a-\sqrt{b}}{c},$ where $a, b,$ and $c$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b+c.$

Solution

Problem 7

Find the number of ordered pairs of positive integers $(a,b)$ such that $a+b=1000$ and neither $a$ nor $b$ has a zero digit.

Solution

Problem 8

There is an unlimited supply of congruent equilateral triangles made of colored paper. Each triangle is a solid color with the same color on both sides of the paper. A large equilateral triangle is constructed from four of these paper triangles. Two large triangles are considered distinguishable if it is not possible to place one on the other, using translations, rotations, and/or reflections, so that their corresponding small triangles are of the same color.

Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles may be formed?

Solution

Problem 9

Circles $\mathcal{C}_1, \mathcal{C}_2,$ and $\mathcal{C}_3$ have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line $t_1$ is a common internal tangent to $\mathcal{C}_1$ and $\mathcal{C}_2$ and has a positive slope, and line $t_2$ is a common internal tangent to $\mathcal{C}_2$ and $\mathcal{C}_3$ and has a negative slope. Given that lines $t_1$ and $t_2$ intersect at $(x,y),$ and that $x=p-q\sqrt{r},$ where $p, q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$

Solution

Problem 10

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B.$ The probability that team $A$ finishes with more points than team $B$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$


Solution

Problem 11

A sequence is defined as follows $a_1=a_2=a_3=1,$ and, for all positive integers $n, a_{n+3}=a_{n+2}+a_{n+1}+a_n.$ Given that $a_{28}=6090307, a_{29}=11201821,$ and $a_{30}=20603361,$ find the remainder when $\sum^{28}_{k=1} a_k$ is divided by 1000.

Solution

Problem 12

Equilateral $\triangle ABC$ is inscribed in a circle of radius 2. Extend $\overline{AB}$ through $B$ to point $D$ so that $AD=13,$ and extend $\overline{AC}$ through $C$ to point $E$ so that $AE = 11.$ Through $D,$ draw a line $l_1$ parallel to $\overline{AE},$ and through $E,$ draw a line $l_2$ parallel to $\overline{AD}.$ Let $F$ be the intersection of $l_1$ and $l_2.$ Let $G$ be the point on the circle that is collinear with $A$ and $F$ and distinct from $A.$ Given that the area of $\triangle CBG$ can be expressed in the form $\frac{p\sqrt{q}}{r},$ where $p, q,$ and $r$ are positive integers, $p$ and $r$ are relatively prime, and $q$ is not divisible by the square of any prime, find $p+q+r.$

An image is supposed to go here. You can help us out by creating one and editing it in. Thanks.

Solution

Problem 13

How many integers $N$ less than 1000 can be written as the sum of $j$ consecutive positive odd integers from exactly 5 values of $j\ge 1.$

Solution

Problem 14

Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from 1 to $10^n$ inclusive. Find the smallest positive integer n for which $S_n$ is an integer.

Solution

Problem 15

Given that $x, y,$ and $z$ are real numbers that satisfy:

$x = \sqrt{y^2-\frac{1}{16}}+\sqrt{z^2-\frac{1}{16}}$
$y = \sqrt{z^2-\frac{1}{25}}+\sqrt{x^2-\frac{1}{25}}$
$z = \sqrt{x^2 - \frac 1{36}}+\sqrt{y^2-\frac 1{36}}$

and that $x+y+z = \frac{m}{\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime, find $m+n.$

Solution

See also

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