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 "User:Rowechen"
Line 4: Line 4:
 
Here's the AIME compilation I will be doing:
 
Here's the AIME compilation I will be doing:
  
−
== Problem 3 ==
+
== Problem 2 ==
−
Sarah intended to multiply a two-digit number and a three-digit number, but she left out the multiplication sign and simply placed the two-digit number to the left of the three-digit number, thereby forming a five-digit number.  This number is exactly nine times the product Sarah should have obtained.  What is the sum of the two-digit number and the three-digit number?
+
Find the number of [[ordered pair]]s <math>(x,y)</math> of positive integers that satisfy <math>x \le 2y \le 60</math> and <math>y \le 2x \le 60</math>.
  
−
[[1997 AIME Problems/Problem 3|Solution]]
+
[[1998 AIME Problems/Problem 2|Solution]]
  
 
== Problem 5 ==
 
== Problem 5 ==
−
For certain real values of <math>a, b, c,</math> and <math>d_{},</math> the equation <math>x^4+ax^3+bx^2+cx+d=0</math> has four non-real roots.  The product of two of these roots is <math>13+i</math> and the sum of the other two roots is <math>3+4i,</math> where <math>i=\sqrt{-1}.</math> Find <math>b.</math>
+
Consider the set of points that are inside or within one unit of a rectangular parallelepiped (box) that measures 3 by 4 by 5 units. Given that the volume of this set is <math> \frac{m + n \pi}{p}, </math> where <math> m, n, </math> and <math> p </math> are positive integers, and <math> n </math> and <math> p </math> are relatively prime, find <math> m + n + p. </math>
  
−
[[1995 AIME Problems/Problem 5|Solution]]
+
[[2003 AIME I Problems/Problem 5|Solution]]
−
 
+
== Problem 6 ==
−
== Problem 4 ==
+
The cards in a stack of <math> 2n </math> cards are numbered consecutively from 1 through <math> 2n </math> from top to bottom. The top <math> n </math> cards are removed, kept in order, and form pile <math> A. </math> The remaining cards form pile <math> B. </math> The cards are then restacked by taking cards alternately from the tops of pile <math> B </math> and <math> A, </math> respectively. In this process, card number <math> (n+1) </math> becomes the bottom card of the new stack, card number 1 is on top of this card, and so on, until piles <math> A </math> and <math> B </math> are exhausted. If, after the restacking process, at least one card from each pile occupies the same position that it occupied in the original stack, the stack is named magical. Find the number of cards in the magical stack in which card number 131 retains its original position.
−
In triangle <math>ABC</math>, angles <math>A</math> and <math>B</math> measure <math>60</math> degrees and <math>45</math> degrees, respectively. The bisector of angle <math>A</math> intersects <math>\overline{BC}</math> at <math>T</math>, and <math>AT=24</math>. The area of triangle <math>ABC</math> can be written in the form <math>a+b\sqrt{c}</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are positive integers, and <math>c</math> is not divisible by the square of any prime. Find <math>a+b+c</math>.
 
−
 
 
−
[[2001 AIME I Problems/Problem 4|Solution]]
 
−
 
 
−
== Problem 9 ==
 
−
A solitaire game is played as follows.  Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand.  The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is <math>p/q,\,</math> where <math>p\,</math> and <math>q\,</math> are relatively prime positive integers.  Find <math>p+q.\,</math>
 
−
 
 
−
[[1994 AIME Problems/Problem 9|Solution]]
 
  
 +
[[2005 AIME II Problems/Problem 6|Solution]]
 
== Problem 8 ==
 
== Problem 8 ==
−
For how many ordered pairs of positive integers <math>(x,y),</math> with <math>y<x\le 100,</math> are both <math>\frac xy</math> and <math>\frac{x+1}{y+1}</math> integers?
+
How many different <math>4\times 4</math> arrays whose entries are all 1's and -1's have the property that the sum of the entries in each row is 0 and the sum of the entries in each column is 0?
−
 
 
−
[[1995 AIME Problems/Problem 8|Solution]]
 
  
 +
[[1997 AIME Problems/Problem 8|Solution]]
 
== Problem 9 ==
 
== Problem 9 ==
−
Triangle <math>ABC</math> is isosceles, with <math>AB=AC</math> and altitude <math>AM=11.</math> Suppose that there is a point <math>D</math> on <math>\overline{AM}</math> with <math>AD=10</math> and <math>\angle BDC=3\angle BAC.</math> Then the perimeter of <math>\triangle ABC</math> may be written in the form <math>a+\sqrt{b},</math> where <math>a</math> and <math>b</math> are integers. Find <math>a+b.</math>
+
Given a nonnegative real number <math>x</math>, let <math>\langle x\rangle</math> denote the fractional part of <math>x</math>; that is, <math>\langle x\rangle=x-\lfloor x\rfloor</math>, where <math>\lfloor x\rfloor</math> denotes the greatest integer less than or equal to <math>x</math>. Suppose that <math>a</math> is positive, <math>\langle a^{-1}\rangle=\langle a^2\rangle</math>, and <math>2<a^2<3</math>. Find the value of <math>a^{12}-144a^{-1}</math>.
  
−
[[Image:AIME_1995_Problem_9.png]]
+
[[1997 AIME Problems/Problem 9|Solution]]
 +
== Problem 10 ==
 +
Let <math>S</math> be the set of points whose coordinates <math>x,</math> <math>y,</math> and <math>z</math> are integers that satisfy <math>0\le x\le2,</math> <math>0\le y\le3,</math> and <math>0\le z\le4.</math>  Two distinct points are randomly chosen from <math>S.</math>  The probability that the midpoint of the segment they determine also belongs to <math>S</math> is <math>m/n,</math> where <math>m</math> and <math>n</math> are relatively prime positive integers.  Find <math>m + n.</math>
  
−
[[1995 AIME Problems/Problem 9|Solution]]
+
[[2001 AIME I Problems/Problem 10|Solution]]
  
 
== Problem 11 ==
 
== Problem 11 ==
−
Let <math>\mathrm {P}</math> be the product of the roots of <math>z^6+z^4+z^3+z^2+1=0</math> that have a positive imaginary part, and suppose that <math>\mathrm {P}=r(\cos{\theta^{\circ}}+i\sin{\theta^{\circ}})</math>, where <math>0<r</math> and <math>0\leq \theta <360</math>. Find <math>\theta</math>.
+
In a rectangular array of points, with 5 rows and <math>N</math> columns, the points are numbered consecutively from left to right beginning with the top row.  Thus the top row is numbered 1 through <math>N,</math> the second row is numbered <math>N + 1</math> through <math>2N,</math> and so forth.  Five points, <math>P_1, P_2, P_3, P_4,</math> and <math>P_5,</math> are selected so that each <math>P_i</math> is in row <math>i.</math> Let <math>x_i</math> be the number associated with <math>P_i.</math>  Now renumber the array consecutively from top to bottom, beginning with the first column.  Let <math>y_i</math> be the number associated with <math>P_i</math> after the renumbering.  It is found that <math>x_1 = y_2,</math> <math>x_2 = y_1,</math> <math>x_3 = y_4,</math> <math>x_4 = y_5,</math> and <math>x_5 = y_3.</math>  Find the smallest possible value of <math>N.</math>
  
−
[[1996 AIME Problems/Problem 11|Solution]]
+
[[2001 AIME I Problems/Problem 11|Solution]]
  
−
== Problem 13 ==
+
== Problem 12 ==
−
Let <math>S</math> be the set of points in the Cartesian plane that satisfy <center><math>\Big|\big| |x|-2\big|-1\Big|+\Big|\big| |y|-2\big|-1\Big|=1.</math></center> If a model of <math>S</math> were built from wire of negligible thickness, then the total length of wire required would be <math>a\sqrt{b}</math>, where <math>a</math> and <math>b</math> are positive integers and <math>b</math> is not divisible by the square of any prime number. Find <math>a+b</math>.
+
A sphere is inscribed in the tetrahedron whose vertices are <math>A = (6,0,0), B = (0,4,0), C = (0,0,2),</math> and <math>D = (0,0,0).</math> The radius of the sphere is <math>m/n,</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m + n.</math>
  
−
[[1997 AIME Problems/Problem 13|Solution]]
+
[[2001 AIME I Problems/Problem 12|Solution]]
 +
== Problem 9 ==
 +
The system of equations
 +
<cmath>\begin{eqnarray*}\log_{10}(2000xy) - (\log_{10}x)(\log_{10}y) & = & 4 \\
 +
\log_{10}(2yz) - (\log_{10}y)(\log_{10}z) & = & 1 \\
 +
\log_{10}(zx) - (\log_{10}z)(\log_{10}x) & = & 0 \\
 +
\end{eqnarray*}</cmath>
  
−
== Problem 12 ==
+
has two solutions <math>(x_{1},y_{1},z_{1})</math> and <math>(x_{2},y_{2},z_{2})</math>. Find <math>y_{1} + y_{2}</math>.
−
Let <math>ABC</math> be [[equilateral triangle|equilateral]], and <math>D, E,</math> and <math>F</math> be the [[midpoint]]s of <math>\overline{BC}, \overline{CA},</math> and <math>\overline{AB},</math> respectively.  There exist [[point]]s <math>P, Q,</math> and <math>R</math> on <math>\overline{DE}, \overline{EF},</math> and <math>\overline{FD},</math> respectively, with the property that <math>P</math> is on <math>\overline{CQ}, Q</math> is on <math>\overline{AR},</math> and <math>R</math> is on <math>\overline{BP}.</math>  The [[ratio]] of the area of triangle <math>ABC</math> to the area of triangle <math>PQR</math> is <math>a + b\sqrt {c},</math> where <math>a, b</math> and <math>c</math> are integers, and <math>c</math> is not divisible by the square of any [[prime]].  What is <math>a^{2} + b^{2} + c^{2}</math>?
 
  
−
[[1998 AIME Problems/Problem 12|Solution]]
+
[[2000 AIME I Problems/Problem 9|Solution]]
  
−
== Problem 11 ==
+
== Problem 12 ==
−
Given that <math>\sum_{k=1}^{35}\sin 5k=\tan \frac mn,</math> where angles are measured in degrees, and <math>m_{}</math> and <math>n_{}</math> are relatively prime positive integers that satisfy <math>\frac mn<90,</math> find <math>m+n.</math>
+
Given a function <math>f</math> for which
 +
<center><math>f(x) = f(398 - x) = f(2158 - x) = f(3214 - x)</math></center>
 +
holds for all real <math>x,</math> what is the largest number of different values that can appear in the list <math>f(0),f(1),f(2),\ldots,f(999)</math>?
  
−
[[1999 AIME Problems/Problem 11|Solution]]
+
[[2000 AIME I Problems/Problem 12|Solution]]
 
== Problem 14 ==
 
== Problem 14 ==
−
Point <math>P_{}</math> is located inside triangle <math>ABC</math> so that angles <math>PAB, PBC,</math> and <math>PCA</math> are all congruent. The sides of the triangle have lengths <math>AB=13, BC=14,</math> and <math>CA=15,</math> and the tangent of angle <math>PAB</math> is <math>m/n,</math> where <math>m_{}</math> and <math>n_{}</math> are relatively prime positive integers.  Find <math>m+n.</math>
+
There are <math>2n</math> complex numbers that satisfy both <math>z^{28} - z^{8} - 1 = 0</math> and <math>|z| = 1</math>. These numbers have the form <math>z_{m} = \cos\theta_{m} + i\sin\theta_{m}</math>, where <math>0\leq\theta_{1} < \theta_{2} < \ldots < \theta_{2n} < 360</math> and angles are measured in degrees. Find the value of <math>\theta_{2} + \theta_{4} + \ldots + \theta_{2n}</math>.
 +
 
 +
[[2001 AIME II Problems/Problem 14|Solution]]
 +
== Problem 13 ==
 +
In triangle <math>ABC</math> the medians <math>\overline{AD}</math> and <math>\overline{CE}</math> have lengths 18 and 27, respectively, and <math>AB = 24</math>.  Extend <math>\overline{CE}</math> to intersect the circumcircle of <math>ABC</math> at <math>F</math>.  The area of triangle <math>AFB</math> is <math>m\sqrt {n}</math>, where <math>m</math> and <math>n</math> are positive integers and <math>n</math> is not divisible by the square of any prime.  Find <math>m + n</math>.
  
−
[[1999 AIME Problems/Problem 14|Solution]]
+
[[2002 AIME I Problems/Problem 13|Solution]]
 
== Problem 14 ==
 
== Problem 14 ==
−
In triangle <math>ABC,</math> it is given that angles <math>B</math> and <math>C</math> are congruent. Points <math>P</math> and <math>Q</math> lie on <math>\overline{AC}</math> and <math>\overline{AB},</math> respectively, so that <math>AP = PQ = QB = BC.</math> Angle <math>ACB</math> is <math>r</math> times as large as angle <math>APQ,</math> where <math>r</math> is a positive real number. Find the greatest integer that does not exceed <math>1000r</math>.
+
The perimeter of triangle <math>APM</math> is <math>152</math>, and the angle <math>PAM</math> is a right angle. A circle of radius <math>19</math> with center <math>O</math> on <math>\overline{AP}</math> is drawn so that it is tangent to <math>\overline{AM}</math> and <math>\overline{PM}</math>. Given that <math>OP=m/n</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>m+n</math>.
  
−
[[2000 AIME I Problems/Problem 14|Solution]]
+
[[2002 AIME II Problems/Problem 14|Solution]]
−
== Problem 15 ==
+
== Problem 13 ==
−
A stack of <math>2000</math> cards is labelled with the integers from <math>1</math> to <math>2000,</math> with different integers on different cards. The cards in the stack are not in numerical order. The top card is removed from the stack and placed on the table, and the next card is moved to the bottom of the stack. The new top card is removed from the stack and placed on the table, to the right of the card already there, and the next card in the stack is moved to the bottom of the stack. The process - placing the top card to the right of the cards already on the table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on the table. It is found that, reading from left to right, the labels on the cards are now in ascending order: <math>1,2,3,\ldots,1999,2000.</math> In the original stack of cards, how many cards were above the card labeled <math>1999</math>?
+
Let <math> N </math> be the number of positive integers that are less than or equal to 2003 and whose base-2 representation has more 1's than 0's. Find the remainder when <math> N </math> is divided by 1000.
  
−
[[2000 AIME I Problems/Problem 15|Solution]]
+
[[2003 AIME I Problems/Problem 13|Solution]]
 
== Problem 14 ==
 
== Problem 14 ==
−
Every positive integer <math>k</math> has a unique factorial base expansion <math>(f_1,f_2,f_3,\ldots,f_m)</math>, meaning that <math>k=1!\cdot f_1+2!\cdot f_2+3!\cdot f_3+\cdots+m!\cdot f_m</math>, where each <math>f_i</math> is an integer, <math>0\le f_i\le i</math>, and <math>0<f_m</math>. Given that <math>(f_1,f_2,f_3,\ldots,f_j)</math> is the factorial base expansion of <math>16!-32!+48!-64!+\cdots+1968!-1984!+2000!</math>, find the value of <math>f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j</math>.
+
The decimal representation of <math> m/n, </math> where <math> m </math> and <math> n </math> are relatively prime positive integers and <math> m < n, </math> contains the digits 2, 5, and 1 consecutively, and in that order. Find the smallest value of <math> n </math> for which this is possible.
−
 
 
−
[[2000 AIME II Problems/Problem 14|Solution]]
 
−
== Problem 13 ==
 
−
In a certain circle, the chord of a <math>d</math>-degree arc is 22 centimeters long, and the chord of a <math>2d</math>-degree arc is 20 centimeters longer than the chord of a <math>3d</math>-degree arc, where <math>d < 120.</math>  The length of the chord of a <math>3d</math>-degree arc is <math>- m + \sqrt {n}</math> centimeters, where <math>m</math> and <math>n</math> are positive integers.  Find <math>m + n.</math>
 
  
−
[[2001 AIME I Problems/Problem 13|Solution]]
+
[[2003 AIME I Problems/Problem 14|Solution]]

Revision as of 08:52, 27 May 2020

Hey how did you get to this page? If you aren't me then I have to say hello. If you are me then I must be pretty conceited to waste my time looking at my own page. If you aren't me, seriously, how did you get to this page? This is pretty cool. Well, nice meeting you! I'm going to stop wasting my time typing this up and do some math. Gtg. Bye.

Here's the AIME compilation I will be doing:

Problem 2

Find the number of ordered pairs $(x,y)$ of positive integers that satisfy $x \le 2y \le 60$ and $y \le 2x \le 60$.

Solution

Problem 5

Consider the set of points that are inside or within one unit of a rectangular parallelepiped (box) that measures 3 by 4 by 5 units. Given that the volume of this set is $\frac{m + n \pi}{p},$ where $m, n,$ and $p$ are positive integers, and $n$ and $p$ are relatively prime, find $m + n + p.$

Solution

Problem 6

The cards in a stack of $2n$ cards are numbered consecutively from 1 through $2n$ from top to bottom. The top $n$ cards are removed, kept in order, and form pile $A.$ The remaining cards form pile $B.$ The cards are then restacked by taking cards alternately from the tops of pile $B$ and $A,$ respectively. In this process, card number $(n+1)$ becomes the bottom card of the new stack, card number 1 is on top of this card, and so on, until piles $A$ and $B$ are exhausted. If, after the restacking process, at least one card from each pile occupies the same position that it occupied in the original stack, the stack is named magical. Find the number of cards in the magical stack in which card number 131 retains its original position.

Solution

Problem 8

How many different $4\times 4$ arrays whose entries are all 1's and -1's have the property that the sum of the entries in each row is 0 and the sum of the entries in each column is 0?

Solution

Problem 9

Given a nonnegative real number $x$, let $\langle x\rangle$ denote the fractional part of $x$; that is, $\langle x\rangle=x-\lfloor x\rfloor$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. Suppose that $a$ is positive, $\langle a^{-1}\rangle=\langle a^2\rangle$, and $2<a^2<3$. Find the value of $a^{12}-144a^{-1}$.

Solution

Problem 10

Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Solution

Problem 11

In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through $N,$ the second row is numbered $N + 1$ through $2N,$ and so forth. Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so that each $P_i$ is in row $i.$ Let $x_i$ be the number associated with $P_i.$ Now renumber the array consecutively from top to bottom, beginning with the first column. Let $y_i$ be the number associated with $P_i$ after the renumbering. It is found that $x_1 = y_2,$ $x_2 = y_1,$ $x_3 = y_4,$ $x_4 = y_5,$ and $x_5 = y_3.$ Find the smallest possible value of $N.$

Solution

Problem 12

A sphere is inscribed in the tetrahedron whose vertices are $A = (6,0,0), B = (0,4,0), C = (0,0,2),$ and $D = (0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Solution

Problem 9

The system of equations \begin{eqnarray*}\log_{10}(2000xy) - (\log_{10}x)(\log_{10}y) & = & 4 \\ \log_{10}(2yz) - (\log_{10}y)(\log_{10}z) & = & 1 \\ \log_{10}(zx) - (\log_{10}z)(\log_{10}x) & = & 0 \\ \end{eqnarray*}

has two solutions $(x_{1},y_{1},z_{1})$ and $(x_{2},y_{2},z_{2})$. Find $y_{1} + y_{2}$.

Solution

Problem 12

Given a function $f$ for which

$f(x) = f(398 - x) = f(2158 - x) = f(3214 - x)$

holds for all real $x,$ what is the largest number of different values that can appear in the list $f(0),f(1),f(2),\ldots,f(999)$?

Solution

Problem 14

There are $2n$ complex numbers that satisfy both $z^{28} - z^{8} - 1 = 0$ and $|z| = 1$. These numbers have the form $z_{m} = \cos\theta_{m} + i\sin\theta_{m}$, where $0\leq\theta_{1} < \theta_{2} < \ldots < \theta_{2n} < 360$ and angles are measured in degrees. Find the value of $\theta_{2} + \theta_{4} + \ldots + \theta_{2n}$.

Solution

Problem 13

In triangle $ABC$ the medians $\overline{AD}$ and $\overline{CE}$ have lengths 18 and 27, respectively, and $AB = 24$. Extend $\overline{CE}$ to intersect the circumcircle of $ABC$ at $F$. The area of triangle $AFB$ is $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

Problem 14

The perimeter of triangle $APM$ is $152$, and the angle $PAM$ is a right angle. A circle of radius $19$ with center $O$ on $\overline{AP}$ is drawn so that it is tangent to $\overline{AM}$ and $\overline{PM}$. Given that $OP=m/n$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Solution

Problem 13

Let $N$ be the number of positive integers that are less than or equal to 2003 and whose base-2 representation has more 1's than 0's. Find the remainder when $N$ is divided by 1000.

Solution

Problem 14

The decimal representation of $m/n,$ where $m$ and $n$ are relatively prime positive integers and $m < n,$ contains the digits 2, 5, and 1 consecutively, and in that order. Find the smallest value of $n$ for which this is possible.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User:Rowechen&oldid=123055"