Found problems: 85335
For a given quadrilateral $A_1A_2B_1B_2,$ a point $P$ is called [i]phenomenal[/i], if line segments $A_1A_2$ and $B_1B_2$ subtend the same angle at point $P$ (i.e. triangles $PA_1A_2$ and $PB_1B_2$ which can be also also degenerate have equal inner angles at point $P$ disregarding orientation).
Three non-collinear points, $A_1,A_2,$ and $B_1$ are given in the plane. Prove that it is possible to find a disc in the plane such that for every point $B_2$ on the disc, the quadrilateral $A_1A_2B_1B_2$ is convex and it is possible to construct seven distinct phenomenal points (with respect to $A_1A_2B_1B_2$) only using a right ruler.
With a right ruler the following two operations are allowed:
[list=1]
[*]Given two points it is possible to draw the straight line connecting them;
[*]Given a point and a straight line, it is possible to draw the straight line passing through the given point which is perpendicular to the given line.
[/list]
[i]Proposed by Á. Bán-Szabó, Budapest[/i]
At the beginning of the academic year, the Olympic Center must accept a certain number of talented students for the 2024 different classes it offers. Although the admitted students are given freedom of choice in classes, there are certain rules. So, any student must take at least one class and cannot take all the classes. At the same time, there cannot be a common class that all students take, and any class must be taken by at least one student. As a final addition to the center's rules, for any student and any class that this student did not enroll in (call this type of class A), the number of students in each A must be greater than the number of classes this student enrolled. At least how many students must the center accept for these rules to be valid?
Let $R(x)$ be a function that takes a natural number as input and returns a rectangle. $R(1)$ is known to have integer side lengths. Let $p(x)$ be the perimeter of $R(x)$ and let $a(x)$ be the area of $R(x)$. Suppose that $p(x+5)=6 p(x)$ for all $x$ in the domain of $R$ and that $a(x+2)=12a(x)$ for all $x> 6$ in the domain of $R$. For $x \leq 6$, $a(x+1)=a(x)+2$. Suppose $p(16)=1296$, and let the side lengths of $R(11)$ be $a$ and $b$ with $a\leq b$. Find the ordered pair $(a,b)$.
[i]Proposed by Matthew Weiss
When $126$ is added to its reversal, $621,$ the sum is $126 + 621 = 747.$ Find the greatest integer which when added to its reversal yields $1211.$
Two equal polygons $F$ and $F'$ are given on the plane. It is known that the vertices of the polygon $F$ belong to $F'$ (may lie inside it or on the border). Is it true that all the vertices of these polygons coincide?
[b]a)[/b] Let $ B,A $ be two subsets of a finite group $ G $ such that $ |A|+|B|>|G| . $ Show that $ G=AB. $
[b]b)[/b] Show that the cyclic group of order $ n+1 $ is the product of the sets $ \{ 0,1,2,\ldots ,m \} $ and $ \{ m,m+1,m+2,\ldots ,n\} , $ where $ 0,1,2,\ldots n $ are residues modulo $ n+1 $ and $ m\le n. $
The figure shows a triangle, a circle circumscribed around it and the center of its inscribed circle. Using only one ruler (one-sided, without divisions), construct the center of the circumscribed circle.
[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two.
(b) Can you arrange these numbers so it works both clockwise and counterclockwise.
[b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace:
$\bullet$ two candies in the box with one chocolate bar,
$\bullet$ two muffins in the box with one chocolate bar,
$\bullet$ two chocolate bars in the box with one candy and one muffin,
$\bullet$ one candy and one chocolate bar in the box with one muffin,
$\bullet$ one muffin and one chocolate bar in the box with one candy.
Is it possible that after some time it remains only one object in the box?
[b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$).
[b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$.
[b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A club provides 30 snacks to 18 members, and each member orders 3 different snacks. It is known that every snack is ordered by at least one member, and that any two members order at most one same snack. Is it possible to find 12 snacks, such that the snacks ordered by any member is not completely in these 12 snacks?
Let $F_n$ be the nth Fibonacci number, defined by $F_1 = F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n > 2$. Let $A_0, A_1, A_2,\cdots$ be a sequence of points on a circle of radius $1$ such that the minor arc from $A_{k-1}$ to $A_k$ runs clockwise and such that
\[\mu(A_{k-1}A_k)=\frac{4F_{2k+1}}{F_{2k+1}^2+1}\]
for $k \geq 1$, where $\mu(XY )$ denotes the radian measure of the arc $XY$ in the clockwise direction. What is the limit of the radian measure of arc $A_0A_n$ as $n$ approaches infinity?
A school has two classes $A$ and $B$ which have $m$ and $n$ students each. The students of the two classes sit in a circle. Each student is then given a number of candies equal to the number of consecutive students sitting to the left of him that are from his same class. After distributing the candies, the teacher decides to group the students such that in each group, all the students receive the same amount of candies, and any two students from two different groups should receive a different amount of candies.
a) What is the maximum number of students that a group can have?
b) Excluding the group where every student receives no candies, what is the maximum number of students that a group can have?
Determine for which $m$ there exist exactly $2^{15}$ subsets $X$ of $\{1,2,...,47\}$ with the following property: $m$ is the smallest element of $X$, and for every $x \in X$, either $x+m \in X$ or $x+m > 47$.
Let $ABC$ be a right triangle in $A$ , whose leg measures $1$ cm. The bisector of the angle $BAC$ cuts the hypotenuse in $R$, the perpendicular to $AR$ on $R$ , cuts the side $AB$ at its midpoint. Find the measurement of the side $AB$ .
A number of spheres with radius $ 1$ are being placed in the form of a square pyramid. First, there is a layer in the form of a square with $ n^2$ spheres. On top of that layer comes the next layer with $ (n\minus{}1)^2$ spheres, and so on. The top layer consists of only one sphere. Compute the height of the pyramid.
Consider a sequence $P_{1}, P_{2}, \ldots$ of points in the plane such that $P_{1}, P_{2}, P_{3}$ are non-collinear and for every $n \geq 4, P_{n}$ is the midpoint of the line segment joining $P_{n-2}$ and $P_{n-3}$. Let $L$ denote the line segment joining $P_{1}$ and $P_{5}$. Prove the following:
[list=a]
[*] The area of the triangle formed by the points $P_{n}, P_{n-1}, P_{n-2}$ converges to zero as $n$ goes to infinity.
[*] The point $P_{9}$ lies on $L$.
[/list]
Find all primes $p,q$ such that
\[p^q-q^p=pq^2-19\]
Steph Curry is playing the following game and he wins if he has exactly $5$ points at some time. Flip a fair coin. If heads, shoot a $3$-point shot which is worth $3$ points. If tails, shoot a free throw which is worth $1$ point. He makes $\frac12$ of his $3$-point shots and all of his free throws. Find the probability he will win the game. (Note he keeps flipping the coin until he has exactly $5$ or goes over $5$ points)
Let $p > 2$ be a prime number. Prove that there is a permutation $k_1, k_2, ..., k_{p-1}$ of numbers $1,2,...,p-1$ such that the number $1^{k_1}+2^{k_2}+3^{k_3}+...+(p-1)^{k_{p-1}}$ is divisible by $p$.
Note: The numbers $k_1, k_2, ..., k_{p-1}$ are a permutation of the numbers $1,2,...,p-1$ if each of of numbers $1,2,...,p-1$ appears exactly once among the numbers $k_1, k_2, ..., k_{p-1}$.
Given three skew lines. Prove that they are pair-wise perpendicular to their pair-wise perpendiculars.
How many $5$-digit numbers $N$ (in base $10$) contain no digits greater than $3$ and satisfy the equality $\gcd(N,15)=\gcd(N,20)=1$? (The leading digit of $N$ cannot be zero.)
[i]Based on a proposal by Yannick Yao[/i]
Let $\omega$ be the circumcircle of $ABC$, and $KL$ be the diameter of $\omega$ passing through $M$ midpoint of $AB$ ($K,C$ lies on different sides of $AB$). A circle passing through $L$ and $M$ meets $CK$ at points $P$ and $Q$ ($Q$ lies on $KP$). Let $LQ$ meet the circumcircle of $KMQ$ again at $R$. Prove that $APBR$ is cyclic.
Suppose that $f(x,y)$ is a continuous real-valued function on the unit square $0\le x\le1,0\le y\le1.$ Show that
$\int_0^1\left(\int_0^1f(x,y)dx\right)^2dy + \int_0^1\left(\int_0^1f(x,y)dy\right)^2dx$
$\le\left(\int_0^1\int_0^1f(x,y)dxdy\right)^2 + \int_0^1\int_0^1\left[f(x,y)\right]^2dxdy.$
Let $f:\mathbb{R}^+\to\mathbb{R}^+$ be a function that satisfies for all $x>y>0$
\[f(x+y)-f(x-y)=4\sqrt{f(x)f(y)}\]
a) Prove that $f(2x)=4f(x)$ for all $x>0$;
b) Find all such functions.
[i]Nikolai Nikolov, Oleg Mushkarov [/i]
Let $a_1, a_2, \dots, a_n$ be positive integers such that none of them is a multiple of $5$. What is the largest integer $n<2005$, such that $a_1^4 + a_2^4 + \cdots + a_n^4$ is divisible by $5$?
$
\textbf{(A)}\ 2000
\qquad\textbf{(B)}\ 2001
\qquad\textbf{(C)}\ 2002
\qquad\textbf{(D)}\ 2003
\qquad\textbf{(E)}\ 2004
$
Let $D$ be a point on the side $AB$ of the triangle $ABC$ such that $BD = CD$, and let the points $E$ on the side $BC$ and $F$ on the extension $AC$ beyond the point $C$ be such that $EF\parallel CD$. The lines $AE$ and $CD$ intersect at the point $G$. Prove that $BC$ is the bisector of the angle $FBG$.