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

How many subsets of the set $\{1, 2, 3, \ldots, 12\}$ contain exactly one or two prime numbers?
An infinitely long slab of glass is rotated. A light ray is pointed at the slab such that the ray is kept horizontal. If $\theta$ is the angle the slab makes with the vertical axis, then $\theta$ is changing as per the function \[ \theta(t) = t^2, \]where $\theta$ is in radians. Let the $\emph{glassious ray}$ be the ray that represents the path of the refracted light in the glass, as shown in the figure. Let $\alpha$ be the angle the glassious ray makes with the horizontal. When $\theta=30^\circ$, what is the rate of change of $\alpha$, with respect to time? Express your answer in radians per second (rad/s) to 3 significant figures. Assume the index of refraction of glass to be $1.50$. Note: the second figure shows the incoming ray and the glassious ray in cyan. [asy] fill((6,-2-sqrt(3))--(3, -2)--(3+4/sqrt(3),2)--(6+4/sqrt(3),2-sqrt(3))--cycle, gray(0.7)); draw((3+2/sqrt(3),0)--(10,0),linetype("4 4")+grey); draw((0,0)--(3+2/sqrt(3),0)); draw((3+2/sqrt(3), 0)--(7+2/sqrt(3), -1)); arrow((6.5+2/sqrt(3), -7/8), dir(180-14.04), 9); draw((3,-2)--(3,2), linetype("4 4")); draw((6,-2-sqrt(3))--(3,-2)--(3+2/sqrt(3),0)--(3+4/sqrt(3), 2)--(6+4/sqrt(3), 2-sqrt(3))); draw(anglemark((3+2/sqrt(3),0),(3,-2),(3,0),15)); label("$\theta$", (3.2, -1.6), N, fontsize(8)); label("$\alpha$", (6, -0.2), fontsize(8)); [/asy] [asy] fill((6,-2-sqrt(3))--(3, -2)--(3+4/sqrt(3),2)--(6+4/sqrt(3),2-sqrt(3))--cycle, gray(0.7)); draw((3+2/sqrt(3),0)--(10,0),linetype("4 4")+grey); draw((0,0)--(3+2/sqrt(3),0), cyan); draw((3+2/sqrt(3), 0)--(7+2/sqrt(3), -1), cyan); arrow((6.5+2/sqrt(3), -7/8), dir(180-14.04), 9, cyan); draw((3,-2)--(3,2), linetype("4 4")); draw((6,-2-sqrt(3))--(3,-2)--(3+2/sqrt(3),0)--(3+4/sqrt(3), 2)--(6+4/sqrt(3), 2-sqrt(3))); draw(anglemark((3+2/sqrt(3),0),(3,-2),(3,0),15)); label("$\theta$", (3.2, -1.6), N, fontsize(8)); label("$\alpha$", (6, -0.2), fontsize(8)); [/asy] [i]Problem proposed by Ahaan Rungta[/i]
The arithmetic mean of two different positive integers $x,y$ is a two digit integer. If one interchanges the digits, the geometric mean of these numbers is archieved. a) Find $x,y$. b) Show that a)'s solution is unique up to permutation if we work in base $g=10$, but that there is no solution in base $g=12$. c) Give more numbers $g$ such that a) can be solved; give more of them such that a) can't be solved, too.
A triangle with sides of $ 5$, $ 12$, and $ 13$ has both an inscibed and a circumscribed circle. What is the distance between the centers of those circles? $ \textbf{(A)}\ \frac{3\sqrt{5}}{2}\qquad \textbf{(B)}\ \frac{7}{2}\qquad \textbf{(C)}\ \sqrt{15}\qquad \textbf{(D)}\ \frac{\sqrt{65}}{2}\qquad \textbf{(E)}\ \frac{9}{2}$
Let there be two circles. Find all points $M$ such that there exist two points, one on each circle such that $M$ is their midpoint.
Find all positive integers $n$, such that $\sigma(n) =\tau(n) \lceil {\sqrt{n}} \rceil$.
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]
An ellipse lies in the $xy$-plane and is tangent to both the $x$-axis and $y$-axis. Given that one of the foci is at $(9, 12)$, compute the minimum possible distance between the two foci.
The number $1$ is written on the blackboard. After that a sequence of numbers is created as follows: at each step each number $a$ on the blackboard is replaced by the numbers $a - 1$ and $a + 1$; if the number $0$ occurs, it is erased immediately; if a number occurs more than once, all its occurrences are left on the blackboard. Thus the blackboard will show $1$ after $0$ steps; $2$ after $1$ step; $1, 3$ after $2$ steps; $2, 2, 4$ after $3$ steps, and so on. How many numbers will there be on the blackboard after $n$ steps?
Find the minimum $k>2$ for which there are $k$ consecutive integers such that the sum of their squares is a square.
Let be three natural numbers $ k,m,n $ an $ m\times n $ matrix $ A, $ an $ n\times m $ matrix $ B, $ and $ k $ complex numbers $ a_0,a_1,\ldots ,a_k $ such that the following conditions hold. $ \text{(i)}\quad m\ge n\ge 2 $ $ \text{(ii)}\quad a_0I_m+a_1AB+a_2(AB)^2+\cdots +a_k(AB)^k=O_m $ $ \text{(iii)}\quad a_0I_m+a_1BA+a_2(BA)^2+\cdots +a_k(BA)^k\neq O_n $ Prove that $ a_0=0. $
Sixteen people for groups of four people such that each two groups have at most two members in common. Prove that there exists a set of six people in which every group is not properly contained in it.
Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer with distinct nonzero digits, $\overline{AB}$, such that $A$ and $B$ are both factors of $\overline{AB}$." Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool, and my favorite number is among those four numbers! Also, the square of my number is the product of two of the other numbers among the four you mentioned!" Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu[/i]
Is it true that for integer $n\ge 2$, and given any non-negative reals $\ell_{ij}$, $1\le i<j\le n$, we can find a sequence $0\le a_1,a_2,\ldots,a_n$ such that for all $1\le i<j\le n$ to have $|a_i-a_j|\ge \ell_{ij}$, yet still $\sum_{i=1}^n a_i\le \sum_{1\le i<j\le n}\ell_{ij}$?
Let $P$ be an arbitrary point in the interior of triangle $\triangle ABC$. Lines$\overline{BP}$ and $\overline{CP}$ intersect $\overline{AC}$ and $\overline{AB}$ at $E$ and $F$, respectively. Let $K$ and $L$ be the midpoints of the segments $BF$ and $CE$, respectively. Let the lines through $L$ and $K$ parallel to $\overline{CF}$ and $\overline{BE}$ intersect $\overline{BC}$ at $S$ and $T$, respectively; moreover, denote by $M$ and $N$ the reflection of $S$ and $T$ over the points $L$ and $K$, respectively. Prove that as $P$ moves in the interior of triangle $\triangle ABC$, line $\overline{MN}$ passes through a fixed point. [i]Proposed by Ali Zamani[/i]
Let $R^+$ be the set of positive real numbers. Determine all functions $f:R^+$ $\rightarrow$ $R^+$ such that for all positive real numbers $x$ and $y:$ \[f(x+f(xy))+y=f(x)f(y)+1\] [i]Ukraine[/i]
Does there exist a set $S$ consisting of rational numbers with the following property: for every integer $n$ there is a unique nonempty, finite subset of $S$, whose elements sum to $n$?
In some country several pairs of cities are connected by direct two-way flights. It is possible to go from any city to any other by a sequence of flights. The distance between two cities is defined to be the least possible numbers of flights required to go from one of them to the other. It is known that for any city there are at most $100$ cities at distance exactly three from it. Prove that there is no city such that more than $2550$ other cities have distance exactly four from it.
Let a triangle $ABC$ , $O$ it's circumcenter , $H$ ortocenter and $M$ the midpoint of $AH$. The perpendicular at $M$ to line $OM$ meets $AB$ and $AC$ at points $P$, respective $Q$. Prove that $MP=MQ$. Babis
All the cells in a $8* 8$ board are colored white. Omar and Asaad play the following game: in the beginning Omar colors $n$ cells red, then Asaad chooses $4$ rows and $4$ columns and colors them black. Omar wins if there is at least one red cell. Find the least possible value for n such that Omar can always win regardless of Asaad's move.
Let $ABC$ a triangle with circumcircle $\Gamma$ and circumcenter $O$. A point $X$, different from $A$, $B$, $C$, or their diametrically opposite points, on $\Gamma$, is chosen. Let $\omega$ the circumcircle of $COX$. Let $E$ the second intersection of $XA$ with $\omega$, $F$ the second intersection of $XB$ with $\omega$ and $D$ a point on line $AB$ such that $CD \perp EF$. Prove that $E$ is the circumcenter of $ADC$ and $F$ is the circumcenter of $BDC$.
Given convex $1000$-gon. Inside this polygon, $1020$ points are chosen so that no $3$ of the $2020$ points do not lie on one line. Polygon is cut into triangles so that these triangles have vertices only those specified $2020$ points and each of these points is the vertex of at least one of cutting triangles. How many such triangles were formed?
A $tetromino$ is a figure made up of four unit squares connected by common edges. [List=i] [*] If we do not distinguish between the possible rotations of a tetromino within its plane, prove that there are seven distinct tetrominos. [*]Prove or disprove the statement: It is possible to pack all seven distinct tetrominos into $4\times 7$ rectangle without overlapping. [/list]
Find all functions $f: \mathbb{R}\backslash\{0,1\} \rightarrow \mathbb{R}$ such that \[ f(x)+f\left(\frac{1}{1-x}\right) = 1+\frac{1}{x(1-x)}. \]
We colored the $n^2$ unit squares of an $n\times n$ square lattice such that in each $2\times 2$ square, at least two of the four unit squares have the same color. What is the largest number of colors we could have used? [i]Based on a problem of the Dürer Competition[/i]