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

Let $ p$ and $ q$ be two consecutive terms of the sequence of odd primes. The number of positive divisor of $ p \plus{} q$, at least $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$
The magnitudes of the sides of triangle $ABC$ are $a$, $b$, and $c$, as shown, with $c\le b\le a$. Through interior point $P$ and the vertices $A$, $B$, $C$, lines are drawn meeting the opposite sides in $A'$, $B'$, $C'$, respectively. Let $s=AA'+BB'+CC'$. Then, for all positions of point $P$, $s$ is less than: $\textbf{(A) }2a+b\qquad\textbf{(B) }2a+c\qquad\textbf{(C) }2b+c\qquad\textbf{(D) }a+2b\qquad \textbf{(E) }$ $a+b+c$ [asy] import math; defaultpen(fontsize(11pt)); pair A = (0,0), B = (1,3), C = (5,0), P = (1.5,1); pair X = extension(B,C,A,P), Y = extension(A,C,B,P), Z = extension(A,B,C,P); draw(A--B--C--cycle); draw(A--X); draw(B--Y); draw(C--Z); dot(P); dot(A); dot(B); dot(C); label("$A$",A,dir(210)); label("$B$",B,dir(90)); label("$C$",C,dir(-30)); label("$A'$",X,dir(-100)); label("$B'$",Y,dir(65)); label("$C'$",Z,dir(20)); label("$P$",P,dir(70)); label("$a$",X,dir(80)); label("$b$",Y,dir(-90)); label("$c$",Z,dir(110)); //Credit to bobthesmartypants for the diagram [/asy]
Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )
Let $S=\{1,2,3,\ldots,n\}$, $n$ an odd number. Find the parity of number of permutations $\sigma : S \Rightarrow S$ such that the sequence defined by \[a(i)=|\sigma(i)-i|\] is monotonous.
[b]p1.[/b] For $25$ bagels they paid as many rubles as the number of bagels you can buy with a ruble. How much does one bagel cost? [b]p2.[/b] Cut the square into the figure into$ 4$ parts of the same shape and size so that each part contains exactly one shaded square. [img]https://cdn.artofproblemsolving.com/attachments/a/2/14f0d435b063bcbc55d3dbdb0a24545af1defb.png[/img] [b]p3.[/b] The numerator and denominator of the fraction are positive numbers. The numerator is increased by $1$, and the denominator is increased by $10$. Can this increase the fraction? [b]p4.[/b] The brother left the house $5$ minutes later than his sister, following her, but walked one and a half times faster than her. How many minutes after leaving will the brother catch up with his sister? [b]p5.[/b] Three apples are worth more than five pears. Can five apples be cheaper than seven pears? Can seven apples be cheaper than thirteen pears? (All apples cost the same, all pears too.) [b]p6.[/b] Give an example of a natural number divisible by $6$ and having exactly $15$ different natural divisors (counting $1$ and the number itself). [b]p7.[/b] In a round dance, $30$ children stand in a circle. Every girl's right neighbor is a boy. Half of the boys have a boy on their right, and all the other boys have a girl on their right. How many boys and girls are there in a round dance? [b]p8.[/b] A sheet of paper was bent in half in a straight line and pierced with a needle in two places, and then unfolded and got $4$ holes. The positions of three of them are marked in figure Where might the fourth hole be? [img]https://cdn.artofproblemsolving.com/attachments/c/8/53b14ddbac4d588827291b27c40e3f59eabc24.png[/img] [b]p9 [/b] The numbers 1$, 2, 3, 4, 5, _, 2000$ are written in a row. First, third, fifth, etc. crossed out in order. Of the remaining $1000 $ numbers, the first, third, fifth, etc. are again crossed out. They do this until one number remains. What is this number? [b]p10.[/b] On the number axis there lives a grasshopper who can jump $1$ and $4$ to the right and left. Can he get from point $1$ to point $2$ of the numerical axis in $1996$ jumps if he must not get to points with coordinates divisible by $4$ (points $0$, $\pm 4$, $\pm 8$ etc.)? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]
Given trapezoid $ ABCD$ with parallel sides $ AB$ and $ CD$, assume that there exist points $ E$ on line $ BC$ outside segment $ BC$, and $ F$ inside segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Denote by $ I$ the point of intersection of $ CD$ and $ EF$, and by $ J$ the point of intersection of $ AB$ and $ EF$. Let $ K$ be the midpoint of segment $ EF$, assume it does not lie on line $ AB$. Prove that $ I$ belongs to the circumcircle of $ ABK$ if and only if $ K$ belongs to the circumcircle of $ CDJ$. [i]Proposed by Charles Leytem, Luxembourg[/i]
Let $\triangle ABC$ be a triangle with $AB=5, BC=6, CA=7$. Suppose $P$ is a point inside $\triangle ABC$ such that $\triangle BPA\sim \triangle APC$. If $AP$ intersects $BC$ at $X$, find $\frac{BX}{CX}$. [i]Proposed by Nathan Ramesh
Consider the triangle $ABC$ and the points $D \in (BC),E \in (CA), F \in (AB)$, such that $\frac{BD}{DC}=\frac{CE}{EA}=\frac{AF}{FB}$. Prove that if the circumcenters of triangles $DEF$ and $ABC$ coincide, then the triangle $ABC$ is equilateral.
A sequence of numbers is defined by $ u_1\equal{}a, u_2\equal{}b$ and $ u_{n\plus{}1}\equal{}\frac{u_n\plus{}u_{n\minus{}1}}{2}$ for $ n \ge 2$. Prove that $ \displaystyle\lim_{n\to\infty}u_n$ exists and express its value in terms of $ a$ and $ b$.
A black bishop and a white king are placed randomly on a $2000 \times 2000$ chessboard (in distinct squares). Let $p$ be the probability that the bishop attacks the king (that is, the bishop and king lie on some common diagonal of the board). Then $p$ can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m$. [i]Proposed by Ahaan Rungta[/i]
Let $A,B\in \mathcal{M}_n(\mathbb{R})$ such that $B^2=I_n$ and $A^2=AB+I_n$. Prove that: \[\det A\le \left(\frac{1+\sqrt{5}}{2}\right)^n\]
Define $f : \mathbb{R}^+ \rightarrow \mathbb{R}$ as the strictly increasing function such that $$f(\sqrt{xy})=\frac{f(x)+f(y)}{2}$$ for all positive real numbers $x,y$. Prove that there are some positive real numbers $a$ where $f(a)<0$. [i] (PP-nine) [/i]
Prove there is an integer $ k$ for which $ k^3 \minus{} 36 k^2 \plus{} 51 k \minus{} 97$ is a multiple of $ 3^{2008.}$
Consider the sequence $(a_n)_{n\geqslant 1}$ defined by $a_1=1/2$ and $2n\cdot a_{n+1}=(n+1)a_n.$[list=a] [*]Determine the general formula for $a_n.$ [*]Let $b_n=a_1+a_2+\cdots+a_n.$ Prove that $\{b_n\}-\{b_{n+1}\}\neq \{b_{n+1}\}-\{b_{n+2}\}.$ [/list]
Let $c: Q-\{0\} \to Q-\{0\}$ a function with the following properties (for all $x,y, a, b \in Q-\{0\}$ and $x \ne 1$): a) $c (x, 1- x) = 1$ b) $c (ab,y) = c (a,y)c(b, y)$ c) $c (y,ab) = c (y, a)c(y,b)$ Show that then $c (a,b) c(b,a) = 1 = c(a,-a)$ also holds.
Let $ABC$ be a triangle, $\Gamma$ its circumcircle, $I$ its incenter, and $\omega$ a tangent circle to the line $AI$ at $I$ and to the side $BC$. Prove that the circles $\Gamma$ and $\omega$ are tangent. Malik Talbi
The four sets A, B, C, and D each have $400$ elements. The intersection of any two of the sets has $115$ elements. The intersection of any three of the sets has $53$ elements. The intersection of all four sets has $28$ elements. How many elements are there in the union of the four sets?
The [i]liar's guessing game[/i] is a game played between two players $A$ and $B$. The rules of the game depend on two positive integers $k$ and $n$ which are known to both players. At the start of the game $A$ chooses integers $x$ and $N$ with $1 \le x \le N.$ Player $A$ keeps $x$ secret, and truthfully tells $N$ to player $B$. Player $B$ now tries to obtain information about $x$ by asking player $A$ questions as follows: each question consists of $B$ specifying an arbitrary set $S$ of positive integers (possibly one specified in some previous question), and asking $A$ whether $x$ belongs to $S$. Player $B$ may ask as many questions as he wishes. After each question, player $A$ must immediately answer it with [i]yes[/i] or [i]no[/i], but is allowed to lie as many times as she wants; the only restriction is that, among any $k+1$ consecutive answers, at least one answer must be truthful. After $B$ has asked as many questions as he wants, he must specify a set $X$ of at most $n$ positive integers. If $x$ belongs to $X$, then $B$ wins; otherwise, he loses. Prove that: 1. If $n \ge 2^k,$ then $B$ can guarantee a win. 2. For all sufficiently large $k$, there exists an integer $n \ge (1.99)^k$ such that $B$ cannot guarantee a win. [i]Proposed by David Arthur, Canada[/i]
Is it possible to write the numbers $17$,$18$,$19$,...$32$ in a $4*4$ grid of unit squares with one number in each square such that if the grid is divided into four $2*2$ subgrids of unit squares ,then the product of numbers in each of the subgrids divisible by $16$?
Can we find positive integers $a$ and $b$ such that both $(a^2 + b)$ and $(b^2 + a)$ are perfect squares?
The center of a circle and nine randomly selected points on this circle are colored in red. Every pair of those points is connected by a line segment, and every point of intersection of two line segments inside the circle is colored in red. What is the largest possible number of red points? A. $235$ B. $245$ C. $250$ D. $220$ E. $265$
Let $\lfloor z \rfloor$ denote the greatest integer less than or equal to $z.$ Compute $$\sum_{j=-1000}^{1000} \left\lfloor \frac{2025}{j+0.5}\right\rfloor.$$
Prair has a box with some combination of red and green balls. If she randomly draws two balls out of the box (without replacement), the probability of drawing two balls of the same color is equal to the probability of drawing two balls of different colors! How many possible values between $200$ and $1000$ are there for the total number of balls in the box? [i]Proposed by Andrew Wu[/i]
Determine the number of non-degenerate rectangles whose edges lie completely on the grid lines of the following figure. $ \begin{tabular}{|c|c|c|c|c|c|} \hline & & & & & \\ \hline & & & & & \\ \hline & & \multicolumn{1}{c}{} & & & \\ \cline{1 \minus{} 2}\cline{5 \minus{} 6} & & \multicolumn{1}{c}{} & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline \end{tabular}$
16 cities attend a football match. Each city has two teams: A and B. According to the rule, each team can compete with any other team of other cities at most once. After a few days, we find that except team A of city 1, the number of matches they've played are different. Then, how many matches have team A of city 1 played?