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

Consider finitely many points in the plane with no three points on a line. All these points can be coloured red or green such that any triangle with vertices of the same colour contains at least one point of the other colour in its interior. What is the maximal possible number of points with this property?
In a cone with height $3$ and base radius $4$, let $X$ be a point on the circumference of the base. Let $Y$ be a point on the surface of the cone such that the distance from $Y$ to the vertex of the cone is $2$, and $Y$ is diametrically opposite $X$ with respect to the base of the cone. The length of the shortest path across the surface of the cone from $X$ to $Y$ can be expressed as $\sqrt{a +\sqrt{b}}$, where a and b are positive integers. Find $a +b$.
The radius of the circle inscribed in triangle $ABC$ is equal to $r$. This circle is tangent to $BC$ at point $M$ and divides the segment $AM$ in ratio $k$ (starting from vertex $A$). Find the sum of the radii of the circles inscribed in triangles $AMB$ and $AMC$.
Prove that two isotomic lines of a triangle cannot meet inside its medial triangle. [i](Two lines are isotomic lines of triangle $ABC$ if their common points with $BC, CA, AB$ are symmetric with respect to the midpoints of the corresponding sides.)[/i]
For her zeroth project at Magic School, Emilia needs to grow six perfectly-shaped apple trees. First she plants six tree saplings at the end of Day $0$. On each day afterwards, Emilia attempts to use her magic to turn each sapling into a perfectly-shaped apple tree, and for each sapling she succeeds in turning it into a perfectly-shaped apple tree that day with a probability of $\frac{1}{2}$. (Once a sapling is turned into a perfectly-shaped apple tree, it will stay a perfectly-shaped apple tree.) The expected number of days it will take Emilia to obtain six perfectly-shaped apple trees is $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $100m+n$. [i]Proposed by Yannick Yao[/i]
If the points $(1,y_1)$ and $(-1,y_2)$ lie on the graph of $y=ax^2+bx+c$, and $y_1-y_2=-6$, then $b$ equals: $\textbf{(A) }-3\qquad \textbf{(B) }0\qquad \textbf{(C) }3\qquad \textbf{(D) }\sqrt{ac}\qquad \textbf{(E) }\dfrac{a+c}2$
Prove that a fifth-degree polynomial $$ P(x) = x^5 - 3x^4 + 6x^3 - 3x^2 + 9x - 6$$ is not the product of two lower-degree polynomials with integer coefficients.
Given two directly congruent triangles $ABC$ and $A'B'C'$ in a plane, assume that the circles with centers $C$ and $C'$ and radii $CA$ and $C'A'$ intersect. Denote by $\mathcal M$ the transformation that maps $\triangle ABC$ to $\triangle A'B'C'$. Prove that $\mathcal M$ can be expressed as a composition of at most three rotations in the following way: The first rotation has the center in one of $A,B,C$ and maps $\triangle ABC$ to $\triangle A_1B_1C_1$; The second rotation has the center in one of $A_1,B_1,C_1$, and maps $\triangle A_1B_1C_1$ to $\triangle A_2B_2C_2$; The third rotation has the center in one of $A_2,B_2,C_2$ and maps $\triangle A_2B_2C_2$ to $\triangle A'B'C'$.
Let $(a_1,a_2,a_3,...,a_{12})$ be a permutation of $(1,2,3,...,12)$ for which \[ a_1>a_2>a_3>a_4>a_5>a_6 \text{ 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.
Let $ABCD$ be a convex quadrilateral with $AB$ is not parallel to $CD$ Circle $\Gamma_{1}$ with center $O_1$ passes through $A$ and $B$, and touches segment $CD$ at $P$. Circle $\Gamma_{2}$ with center $O_2$ passes through $C$ and $D$, and touches segment $AB$ at $Q$. Let $E$ and $F$ be the intersection of circles $\Gamma_{1}$ and $\Gamma_{2}$. Prove that $EF$ bisects segment $PQ$ if and only if $BC$ is parallel to $AD$.
Let $ABCD$ be a cyclic quadrilateral, $K$ and $N$ be the midpoints of the diagonals and $P$ and $Q$ be points of intersection of the extensions of the opposite sides. Prove that $\angle PKQ + \angle PNQ = 180$. [i]($7$ points)[/i] .
1) Let $a$ and $b$ be relatively prime positive integers. Prove that there is a positive integer $n$ such that $1 \le n \le b$ and $b$ divides $a^n - 1$. 2) Prove that there is a multiple of $7^{2010}$ of the form $99... 9$ ($n$ nines), for some positive integer $n$ not exceeding $7^{2010}$.
There is child camp with some rooms. Call room as $4-$room, if $4$ children live here. Not less then half of all rooms are $4-$rooms , other rooms are $3-$rooms. Not less than $2/3$ girls live in $3-$rooms. Prove that not less than $35\%$ of all children are boys.
Let $S$ be a square with the side length 20 and let $M$ be the set of points formed with the vertices of $S$ and another 1999 points lying inside $S$. Prove that there exists a triangle with vertices in $M$ and with area at most equal with $\frac 1{10}$. [i]Yugoslavia[/i]
Given a positive integer $n$, there are $n$ boxes $B_1,...,B_n$. The following procedure can be used to add balls. $$\text{(Procedure) Chosen two positive integers }n\geq i\geq j\geq 1\text{, we add one ball each to the boxes }B_k\text{ that }i\geq k\geq j.$$ For positive integers $x_1,...,x_n$ let $f(x_1,...,x_n)$ be the minimum amount of procedures to get all boxes have its amount of balls to be a multiple of 3, starting with $x_i$ balls for $B_i(i=1,...,n)$. Find the largest possible value of $f(x_1,...,x_n)$. (If $x_1,...,x_n$ are all multiples of 3, $f(x_1,...,x_n)=0$.)
For $ n\in\mathbb{N}$, determine the number of natural solutions $ (a,b)$ such that \[ (4a\minus{}b)(4b\minus{}a)\equal{}2010^n\] holds.
Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$
What is the value of $(8 \times 4 + 2) - (8 + 4 \times 2)?$ $\textbf{(A)}~0\qquad\textbf{(B)}~6\qquad\textbf{(C)}~10\qquad\textbf{(D)}~18\qquad\textbf{(E)}~24$
Find the least natural number $n$, which has at least 6 different divisors $1=d_1<d_2<d_3<d_4<d_5<d_6<...$, for which $d_3+d_4=d_5+6$ and $d_4+d_5=d_6+7$.
What positive number is equal to twice its square? $\text{(A) }\frac{1}{4}\qquad\text{(B) }\frac{1}{2}\qquad\text{(C) }1\qquad\text{(D) }2\qquad\text{(E) }\frac{5}{2}$
We consider the following system with $q=2p$: \[\begin{matrix} a_{11}x_{1}+\ldots+a_{1q}x_{q}=0,\\ a_{21}x_{1}+\ldots+a_{2q}x_{q}=0,\\ \ldots ,\\ a_{p1}x_{1}+\ldots+a_{pq}x_{q}=0,\\ \end{matrix}\] in which every coefficient is an element from the set $\{-1,0,1\}$$.$ Prove that there exists a solution $x_{1}, \ldots,x_{q}$ for the system with the properties: [b]a.)[/b] all $x_{j}, j=1,\ldots,q$ are integers$;$ [b]b.)[/b] there exists at least one j for which $x_{j} \neq 0;$ [b]c.)[/b] $|x_{j}| \leq q$ for any $j=1, \ldots ,q.$
Let $n$ ($n \ge 1$) be an integer. Consider the equation $2\cdot \lfloor{\frac{1}{2x}}\rfloor - n + 1 = (n + 1)(1 - nx)$, where $x$ is the unknown real variable. (a) Solve the equation for $n = 8$. (b) Prove that there exists an integer $n$ for which the equation has at least $2021$ solutions. (For any real number $y$ by $\lfloor{y} \rfloor$ we denote the largest integer $m$ such that $m \le y$.)
Let $a\circ b=a+b-ab$. Find all triples $(x,y,z)$ of integers such that \[(x\circ y)\circ z +(y\circ z)\circ x +(z\circ x)\circ y=0\]
Prove that there exists such a number $A$ that you can inscribe $1978$ different size squares in the plot of the function $y = A sin(x)$. (The square is inscribed if all its vertices belong to the plot.)
For $ k>0$, let $ I_k\equal{}10\ldots 064$, where there are $ k$ zeros between the $ 1$ and the $ 6$. Let $ N(k)$ be the number of factors of $ 2$ in the prime factorization of $ I_k$. What is the maximum value of $ N(k)$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 8\qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ 10$