Found problems: 567
1991 AMC 12/AHSME, 24
The graph, $G$ of $y = \log_{10}x$ is rotated $90^{\circ}$ counter-clockwise about the origin to obtain a new graph $G'$. Which of the following is an equation for $G'$?
$ \textbf{(A)}\ y = \log_{10}\left(\frac{x + 90}{9}\right)\qquad\textbf{(B)}\ y = \log_{x}10\qquad\textbf{(C)}\ y = \frac{1}{x + 1}\qquad\textbf{(D)}\ y = 10^{-x}\qquad\textbf{(E)}\ y = 10^{x} $
2017 BMT Spring, 6
The center of a square of side length $ 1$ is placed uniformly at random inside a circle of radius $ 1$. Given that we are allowed to rotate the square about its center, what is the probability that the entire square is contained within the circle for some orientation of the square?
2004 AMC 12/AHSME, 9
The point $ (\minus{}3, 2)$ is rotated $ 90^\circ$ clockwise around the origin to point $ B$. Point $ B$ is then reflected over the line $ y \equal{} x$ to point $ C$. What are the coordinates of $ C$?
$ \textbf{(A)}\ ( \minus{} 3, \minus{} 2)\qquad \textbf{(B)}\ ( \minus{} 2, \minus{} 3)\qquad \textbf{(C)}\ (2, \minus{} 3)\qquad \textbf{(D)}\ (2,3)\qquad \textbf{(E)}\ (3,2)$
2002 All-Russian Olympiad, 1
There are eight rooks on a chessboard, no two attacking each other. Prove that some two of the pairwise distances between the rooks are equal. (The distance between two rooks is the distance between the centers of their cell.)
1998 Irish Math Olympiad, 2
The distances from a point $ P$ inside an equilateral triangle to the vertices of the triangle are $ 3,4$, and $ 5$. Find the area of the triangle.
2014 AMC 12/AHSME, 18
The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] if it is not true that for every $n$ from $1$ to $15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?
$ \textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5 $
2013 Iran Team Selection Test, 18
A special kind of parallelogram tile is made up by attaching the legs of two right isosceles triangles of side length $1$. We want to put a number of these tiles on the floor of an $n\times n$ room such that the distance from each vertex of each tile to the sides of the room is an integer and also no two tiles overlap. Prove that at least an area $n$ of the room will not be covered by the tiles.
[i]Proposed by Ali Khezeli[/i]
1986 IMO Longlists, 33
Let $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.
PEN N Problems, 8
An integer sequence $\{a_{n}\}_{n \ge 1}$ is given such that \[2^{n}=\sum^{}_{d \vert n}a_{d}\] for all $n \in \mathbb{N}$. Show that $a_{n}$ is divisible by $n$ for all $n \in \mathbb{N}$.
2011 USAMO, 2
An integer is assigned to each vertex of a regular pentagon so that the sum of the five integers is 2011. A turn of a solitaire game consists of subtracting an integer $m$ from each of the integers at two neighboring vertices and adding $2m$ to the opposite vertex, which is not adjacent to either of the first two vertices. (The amount $m$ and the vertices chosen can vary from turn to turn.) The game is won at a certain vertex if, after some number of turns, that vertex has the number 2011 and the other four vertices have the number 0. Prove that for any choice of the initial integers, there is exactly one vertex at which the game can be won.
2006 MOP Homework, 3
Let $ABC$ be a triangle with $AB\neq AC$, and let $A_{1}B_{1}C_{1}$ be the image of triangle $ABC$ through a rotation $R$ centered at $C$.
Let $M,E , F$ be the midpoints of the segments $BA_{1}, AC, BC_{1}$ respectively
Given that $EM = FM$, compute $\angle EMF$.
2009 AMC 12/AHSME, 23
Functions $ f$ and $ g$ are quadratic, $ g(x) \equal{} \minus{} f(100 \minus{} x)$, and the graph of $ g$ contains the vertex of the graph of $ f$. The four $ x$-intercepts on the two graphs have $ x$-coordinates $ x_1$, $ x_2$, $ x_3$, and $ x_4$, in increasing order, and $ x_3 \minus{} x_2 \equal{} 150$. The value of $ x_4 \minus{} x_1$ is $ m \plus{} n\sqrt p$, where $ m$, $ n$, and $ p$ are positive integers, and $ p$ is not divisible by the square of any prime. What is $ m \plus{} n \plus{} p$?
$ \textbf{(A)}\ 602\qquad \textbf{(B)}\ 652\qquad \textbf{(C)}\ 702\qquad \textbf{(D)}\ 752\qquad \textbf{(E)}\ 802$
2003 APMO, 2
Suppose $ABCD$ is a square piece of cardboard with side length $a$. On a plane are two parallel lines $\ell_1$ and $\ell_2$, which are also $a$ units apart. The square $ABCD$ is placed on the plane so that sides $AB$ and $AD$ intersect $\ell_1$ at $E$ and $F$ respectively. Also, sides $CB$ and $CD$ intersect $\ell_2$ at $G$ and $H$ respectively. Let the perimeters of $\triangle AEF$ and $\triangle CGH$ be $m_1$ and $m_2$ respectively.
Prove that no matter how the square was placed, $m_1+m_2$ remains constant.
2014 PUMaC Team, 12
Let $n$ be the number of possible ways to place six orange balls, six black balls, and six white balls in a circle (two placements are considered equivalent if one can be rotated to fit the other). What is the remainder when $n$ is divided by $1000$?
2010 Paraguay Mathematical Olympiad, 2
A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have?
[img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img]
Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted)
Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.
2009 Princeton University Math Competition, 7
You are given a convex pentagon $ABCDE$ with $AB=BC$, $CD=DE$, $\angle{ABC}=150^\circ$, $\angle{BCD} = 165^\circ$, $\angle{CDE}=30^\circ$, $BD=6$. Find the area of this pentagon. Round your answer to the nearest integer if necessary.
[asy]
pathpen = rgb(0,0,0.6)+linewidth(0.7); pointpen = black+linewidth(3); pointfontpen = fontsize(10);
pair A = (0,0), B = (0.8,-1.8), C = B+rotate(-150)*(A-B), D = IP(CR(B,6), C--C+rotate(-165)*6*(B-C)), E = D+rotate(-30)*(C-D); D(D("B",B,W)--D("C",C,SW)--D("D",D,plain.E)--D("E",E,NE)--D("A",A,NW)--B--D);
[/asy]
1990 Tournament Of Towns, (274) 2
The plane is divided by three infinite sets of parallel lines into equilateral triangles of equal area. Let $M$ be the set of their vertices, and $A$ and $B$ be two vertices of such an equilateral triangle. One may rotate the plane through $120^o$ around any vertex of the set $M$. Is it possible to move the point $A$ to the point $B$ by a number of such rotations
(N Vasiliev, Moscow)
2008 AMC 12/AHSME, 25
A sequence $ (a_1,b_1)$, $ (a_2,b_2)$, $ (a_3,b_3)$, $ \ldots$ of points in the coordinate plane satisfies \[ (a_{n \plus{} 1}, b_{n \plus{} 1}) \equal{} (\sqrt {3}a_n \minus{} b_n, \sqrt {3}b_n \plus{} a_n)\hspace{3ex}\text{for}\hspace{3ex} n \equal{} 1,2,3,\ldots.\] Suppose that $ (a_{100},b_{100}) \equal{} (2,4)$. What is $ a_1 \plus{} b_1$?
$ \textbf{(A)}\\minus{} \frac {1}{2^{97}} \qquad
\textbf{(B)}\\minus{} \frac {1}{2^{99}} \qquad
\textbf{(C)}\ 0 \qquad
\textbf{(D)}\ \frac {1}{2^{98}} \qquad
\textbf{(E)}\ \frac {1}{2^{96}}$
1991 IMTS, 5
The sides of $\triangle ABC$ measure 11,20, and 21 units. We fold it along $PQ,QR,RP$ where $P,Q,R$ are the midpoints of its sides until $A,B,C$ coincide. What is the volume of the resulting tetrahedron?
2012 Today's Calculation Of Integral, 796
Answer the following questions:
(1) Let $a$ be non-zero constant. Find $\int x^2 \cos (a\ln x)dx.$
(2) Find the volume of the solid generated by a rotation of the figures enclosed by the curve $y=x\cos (\ln x)$, the $x$-axis and
the lines $x=1,\ x=e^{\frac{\pi}{4}}$ about the $x$-axis.
2005 Baltic Way, 11
Let the points $D$ and $E$ lie on the sides $BC$ and $AC$, respectively, of the triangle $ABC$, satisfying $BD=AE$. The line joining the circumcentres of the triangles $ADC$ and $BEC$ meets the lines $AC$ and $BC$ at $K$ and $L$, respectively. Prove that $KC=LC$.
2007 AMC 12/AHSME, 16
Each face of a regular tetrahedron is painted either red, white or blue. Two colorings are considered indistinguishable if two congruent tetrahedra with those colorings can be rotated so that their appearances are identical. How many distinguishable colorings are possible?
$ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 27 \qquad \textbf{(D)}\ 54 \qquad \textbf{(E)}\ 81$
2009 Princeton University Math Competition, 1
You have an unlimited supply of monominos, dominos, and L-trominos. How many ways, in terms of $n$, can you cover a $2 \times n$ grid with these shapes? Please note that you do [i]NOT[/i] have to use all the shapes. Also, you are allowed to [i]rotate[/i] any of the pieces, so they do not have to be aligned exactly as they are in the diagram below.
[asy]
pen db = rgb(0,0,0.5); real r = 0.08; pair s1 = (3,0), s2 = 2*s1;
fill(unitsquare, db); fill(shift(s1)*unitsquare, db); fill(shift(s1-(0,1+r))*unitsquare, db); fill(shift(s2)*unitsquare, db); fill(shift(s2-(0,1+r))*unitsquare, db); fill(shift(s2+(1+r,-1-r))*unitsquare, db);
[/asy]
1989 Romania Team Selection Test, 5
A laticial cycle of length $n$ is a sequence of lattice points $(x_k, y_k)$, $k = 0, 1,\cdots, n$, such that $(x_0, y_0) = (x_n, y_n) = (0, 0)$ and $|x_{k+1} -x_{k}|+|y_{k+1} - y_{k}| = 1$ for each $k$. Prove that for all $n$, the number of latticial cycles of length $n$ is a perfect square.
2005 QEDMO 1st, 8 (Z2)
Prove that if $n$ can be written as $n=a^2+ab+b^2$, then also $7n$ can be written that way.