This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

The function f is defined on the set of integers and satisfies $\bullet$ $f(n) = n - 2$, if $n \ge 2005$ $\bullet$ $f(n) = f(f(n+7))$, if $n < 2005$. Find $f(3)$.
A triangle has side lengths $a, b, c$ and angles $A, B, C$ as usual (with $b$ opposite $B$ etc). Show that if $$a(1 - 2 \cos A) + b(1 - 2 \cos B) + c(1 - 2 \cos C) = 0$$ then the triangle is equilateral.
Viswam walks half a mile to get to school each day. His route consists of $10$ city blocks of equal length and he takes one minute to walk each block. Today, after walking $5$ blocks, Viswam discovers he has to take a detour, walking $3$ blocks of equal length instead of one block to reach the next corner. From the time he starts his detour what speed, in mph, must he walk in order to get to school at his usual time? $\textbf{(A)}~4.0\qquad\textbf{(B)}~4.2\qquad\textbf{(C)}~4.5\qquad\textbf{(D)}~4.8\qquad\textbf{(E)}~5.0\qquad$
The bisectors of the angles $\angle{A},\angle{B},\angle{C}$ of a triangle $\triangle{ABC}$ intersect with the circumcircle $c_1(O,R)$ of $\triangle{ABC}$ at $A_2,B_2,C_2$ respectively.The tangents of $c_1$ at $A_2,B_2,C_2$ intersect each other at $A_3,B_3,C_3$ (the points $A_3,A$ lie on the same side of $BC$,the points $B_3,B$ on the same side of $CA$,and $C_3,C$ on the same side of $AB$).The incircle $c_2(I,r)$ of $\triangle{ABC}$ is tangent to $BC,CA,AB$ at $A_1,B_1,C_1$ respectively.Prove that $A_1A_2,B_1B_2,C_1C_2,AA_3,BB_3,CC_3$ are concurrent. [hide=Diagram][asy]import graph; size(11cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -9.26871978147865, xmax = 19.467150423463277, ymin = -6.150626456647122, ymax = 10.10782642246474; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); draw((1.0409487561836381,4.30054785243355)--(0.,0.)--(6.,0.)--cycle, aqaqaq); /* draw figures */ draw((1.0409487561836381,4.30054785243355)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.0409487561836381,4.30054785243355), uququq); draw(circle((3.,1.550104087253063), 3.376806580383107)); draw(circle((1.9303371951242874,1.5188413314630436), 1.5188413314630436)); draw((1.0226422135625703,7.734611112525813)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((-1.2916762981259242,-1.8267024931300444)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((-0.2820306621765219,2.344520485530311)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((1.0559139088339535,1.4932847901569466)--(5.212367857300808,4.101231513568902), linetype("2 2")); draw((1.0559139088339535,1.4932847901569466)--(3.,-1.8267024931300442), linetype("2 2")); draw((12.047991949367804,-1.8267024931300444)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((1.0226422135625703,7.734611112525813)--(-1.2916762981259242,-1.8267024931300444)); draw((-1.2916762981259242,-1.8267024931300444)--(12.047991949367804,-1.8267024931300444)); draw((12.047991949367804,-1.8267024931300444)--(1.0226422135625703,7.734611112525813)); /* dots and labels */ dot((1.0409487561836381,4.30054785243355),linewidth(3.pt) + dotstyle); label("$A$", (0.5889800538632699,4.463280489351154), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.5723380089304358,-0.10096957139619551), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.233525986976863,0.06107480945873997), NE * labelscalefactor); label("$c_1$", (1.9663572911302232,5.111458012770896), NE * labelscalefactor); dot((3.,-1.8267024931300442),linewidth(3.pt) + dotstyle); label("$A_2$", (2.9386235762598374,-2.3155761097469805), NE * labelscalefactor); dot((5.212367857300808,4.101231513568902),linewidth(3.pt) + dotstyle); label("$B_2$", (5.315274495465561,4.274228711687063), NE * labelscalefactor); dot((-0.2820306621765219,2.344520485530311),linewidth(3.pt) + dotstyle); label("$C_2$", (-0.9234341674494632,2.6807922999468636), NE * labelscalefactor); dot((1.0226422135625703,7.734611112525813),linewidth(3.pt) + dotstyle); label("$A_3$", (1.1291279900463889,7.893219884113956), NE * labelscalefactor); dot((-1.2916762981259242,-1.8267024931300444),linewidth(3.pt) + dotstyle); label("$B_3$", (-1.8146782621516093,-1.4783468086631473), NE * labelscalefactor); dot((12.047991949367804,-1.8267024931300444),linewidth(3.pt) + dotstyle); label("$C_3$", (12.148145888182015,-1.6673985863272387), NE * labelscalefactor); dot((1.9303371951242874,1.5188413314630436),linewidth(3.pt) + dotstyle); label("$I$", (2.047379481557691,1.681518618008095), NE * labelscalefactor); dot((1.9303371951242878,0.),linewidth(3.pt) + dotstyle); label("$A_1$", (1.4532167517562602,-0.5600953171518461), NE * labelscalefactor); label("$c_2$", (1.5072315453745722,3.247947632939138), NE * labelscalefactor); dot((2.9254299438737803,2.666303492733126),linewidth(3.pt) + dotstyle); label("$B_1$", (2.8576013858323694,3.1129106488933584), NE * labelscalefactor); dot((0.45412477306806903,1.8761589424582812),linewidth(3.pt) + dotstyle); label("$C_1$", (0,2.3296961414278368), NE * labelscalefactor); dot((1.0559139088339535,1.4932847901569466),linewidth(3.pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]
$\frac{1-\frac{1}{3}}{1-\frac{1}{2}} =$ $\text{(A)}\ \frac{1}{3} \qquad \text{(B)}\ \frac{2}{3} \qquad \text{(C)}\ \frac{3}{4} \qquad \text{(D)}\ \frac{3}{2} \qquad \text{(E)}\ \frac{4}{3}$
In the figure below, semicircles with centers at $A$ and $B$ and with radii $2$ and $1$, respectively, are drawn in the interior of, and sharing bases with, a semicircle with diameter $\overline{JK}$. The two smaller semicircles are externally tangent to each other and internally tangent to the largest semicircle. A circle centered at $P$ is drawn externally tangent to the two smaller semicircles and internally tangent to the largest semicircle. What is the radius of the circle centered at $P$? [asy] size(8cm); draw(arc((0,0),3,0,180)); draw(arc((2,0),1,0,180)); draw(arc((-1,0),2,0,180)); draw((-3,0)--(3,0)); pair P = (-1,0)+(2+6/7)*dir(36.86989); draw(circle(P,6/7)); dot((-1,0)); dot((2,0)); dot((-3,0)); dot((3,0)); dot(P); label("$J$",(-3,0),W); label("$A$",(-1,0),NW); label("$B$",(2,0),NE); label("$K$",(3,0),E); label("$P$",P,NW); [/asy] $ \textbf{(A)}\ \frac{3}{4} \qquad \textbf{(B)}\ \frac{6}{7} \qquad\textbf{(C)}\ \frac{1}{2}\sqrt{3} \qquad\textbf{(D)}\ \frac{5}{8}\sqrt{2} \qquad\textbf{(E)}\ \frac{11}{12} $
In the non-isosceles triangle $ABC$,$D$ is the midpoint of side $BC$,$E$ is the midpoint of side $CA$,$F$ is the midpoint of side $AB$.The line(different from line $BC$) that is tangent to the inscribed circle of triangle $ABC$ and passing through point $D$ intersect line $EF$ at $X$.Define $Y,Z$ similarly.Prove that $X,Y,Z$ are collinear.
Find all the pairs of integers $ (a,b)$ satisfying $ ab(a \minus{} b)\not \equal{} 0$ such that there exists a subset $ Z_{0}$ of set of integers $ Z,$ for any integer $ n$, exactly one among three integers $ n,n \plus{} a,n \plus{} b$ belongs to $ Z_{0}$.
Find all positive integers $a$, $b$, $n$ and prime numbers $p$ that satisfy \[ a^{2013} + b^{2013} = p^n\text{.}\] [i]Proposed by Matija Bucić.[/i]
In how many different ways can the set $\{1,2,\dots, 2006\}$ be divided into three non-empty sets such that no set contains two successive numbers? $ \textbf{(A)}\ 3^{2006}-3\cdot 2^{2006}+1 \qquad\textbf{(B)}\ 2^{2005}-2 \qquad\textbf{(C)}\ 3^{2004} \qquad\textbf{(D)}\ 3^{2005}-1 \qquad\textbf{(E)}\ \text{None of above} $
Prove that there is no positive integer $n$ such that, for $k=1, 2, \cdots, 9,$ the leftmost digit of $(n+k)!$ equals $k$.
Which of the following numbers is a perfect square? $ \textbf{(A)}\ \dfrac{14!15!}2\qquad\textbf{(B)}\ \dfrac{15!16!}2\qquad\textbf{(C)}\ \dfrac{16!17!}2\qquad\textbf{(D)}\ \dfrac{17!18!}2\qquad\textbf{(E)}\ \dfrac{18!19!}2 $
The sequence $(x_n)$ is determined by the conditions: $x_0=1992,x_n=-\frac{1992}{n} \cdot \sum_{k=0}^{n-1} x_k$ for $n \geq 1$. Find $\sum_{n=0}^{1992} 2^nx_n$.
Let $ABCD$ be a convex quadrilateral with the property that $MA \cdot MC + MA \cdot CD = MB \cdot MD$, where $M$ is the intersection of the diagonals $AC$ and $BD$. The angle bisector of $\angle ACD$ is drawn intersecting ray $\overrightarrow{BA}$ at $K$. Prove that $BC = DK$ if and only if $AB \parallel CD$.
Three points $X,Y$ and $Z$ are given that are, respectively, the circumcenter of a triangle $ABC$, the mid-point of $BC$, and the foot of the altitude from $B$ on $AC$. Show how to reconstruct the triangle $ABC$.
Santa Claus plays a guessing game with Marvin before giving him his present. He hides the present behind one of $100$ doors, numbered from $1$ to $100$. Marvin can point at a door, and then Santa Claus will reply with one of the following words: $\bullet$ "hot" if the present lies behind the guessed door, $\bullet$ "warm" if the guess is not exact but the number of the guessed door differs from that of the present’s door by at most $5$, $\bullet$ "cold" if the numbers of the two doors differ by more than $5$. At least how many such guesses does Marvin need, so that he can be certain about where his present is? Marvin does not necessarily need to make a "hot" guess, just to know the correct door with $100\%$ certainty.
Points $A,B,C,D$ have been marked on checkered paper (see fig.). Find the tangent of the angle $ABD$. [img]https://cdn.artofproblemsolving.com/attachments/6/1/eeb98ccdee801361f9f66b8f6b2da4714e659f.png[/img]
Given a positive integer $n$, an $n$-gun is a $2n$-mino that is formed by putting a $1 \times n$ grid and an $n \times 1$ grid side by side so that one of the corner unit squares of the first grid is next to one of the corner unit squares of the second grid. Find the minimum possible $k$ such that it is possible to color the infinite planar grid with $k$ colors such that any $n$-gun cannot cover two different squares with the same color. [i]Itf0501[/i]
With $150$ white cubes of $1 \times 1 \times 1$ a prism of $6 \times 5 \times 5$ is assembled, its six faces are painted blue and then the prism is disassembled. Lucrecia must build a new prism, without holes, exclusively using cubes that have at least one blue face and so that the faces of Lucrecia's prism are all completely blue. Give the dimensions of the prism with the largest volume that Lucrecia can assemble.
Given an non-negative integer $k$, show that there are infinitely many positive integers $n$ such that the product of any $n$ consecutive integers is divisible by $(n+k)^2+1$.
If $x$ and $\log_{10} x$ are real numbers and $\log_{10} x<0$, then: $\textbf{(A)}\ x<0 \qquad \textbf{(B)}\ -1<x<1 \qquad \textbf{(C)}\ 0<x\le 1 $ $ \textbf{(D)}\ -1<x<0 \qquad \textbf{(E)}\ 0<x<1$
Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that \[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]
Piglet added together three consecutive whole numbers, then the next three numbers, and multiplied one sum by the other. Could the product be equal to $111,111,111$?
Consider a chessboard $6 \times 6$, made up of $36$ single squares. We want to place $6$ chess rooks on this board, one rook on each square, so that there are no two rooks on the same row, nor two rooks on the same column. Note that, once the rooks have been placed in this way, we have that, for every square where a rook has not been placed, there is a rook in the same row as it and a rook in the same column as it. We will say that such rooks are in line with this square. For each of those $30$ houses without rooks, color it green if the two rooks aligned with that same house are the same distance from it, and color it yellow otherwise. For example, when we place the $6$ rooks ($T$) as below, we have: (a) Is it possible to place the rooks so that there are $30$ green squares? (b) Is it possible to place the rooks so that there are $30$ yellow squares? (c) Is it possible to place the rooks so that there are $15$ green and $15$ yellow squares?
In triangle $ABC$, $D$ is the midpoint of side $AB$. $E$ and $F$ are points arbitrarily chosen on segments $AC$ and $BC$, respectively. Show that $[DEF] < [ADE] + [BDF]$.