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$ be a point in the interior of an acute triangle $ABC$, and let $Q$ be its isogonal conjugate. Denote by $\omega_P$ and $\omega_Q$ the circumcircles of triangles $BPC$ and $BQC$, respectively. Suppose the circle with diameter $\overline{AP}$ intersects $\omega_P$ again at $M$, and line $AM$ intersects $\omega_P$ again at $X$. Similarly, suppose the circle with diameter $\overline{AQ}$ intersects $\omega_Q$ again at $N$, and line $AN$ intersects $\omega_Q$ again at $Y$. Prove that lines $MN$ and $XY$ are parallel. (Here, the points $P$ and $Q$ are [i]isogonal conjugates[/i] with respect to $\triangle ABC$ if the internal angle bisectors of $\angle BAC$, $\angle CBA$, and $\angle ACB$ also bisect the angles $\angle PAQ$, $\angle PBQ$, and $\angle PCQ$, respectively. For example, the orthocenter is the isogonal conjugate of the circumcenter.) [i]Proposed by Sammy Luo[/i]
Find all sets of natural numbers $(a, b, c)$ such that $$a+1|b^2+c^2\,\, , b+1|c^2+a^2\,\,, c+1|a^2+b^2.$$
Find the area enclosed by the graph of $|x|+|2y|=12$. [i]Proposed by Nathan Ramesh
A list consists of all positive integers from $1$ to $2020$, inclusive, with each integer appearing exactly once. Define a move as the process of choosing four numbers from the current list and replacing them with the numbers $1,2,3,4$. If the expected number of moves before the list contains exactly two $4$'s can be expressed as $\frac{a}{b}$ for relatively prime positive integers, evaluate $a+b$. [i]Proposed by Richard Chen and Taiki Aiba[/i]
In a non-convex hexagon, each angle is either $90$ or $270$ degrees. Is it true that for some lengths of the sides it can be cut into two hexagons similar to it and unequal to each other?
Calculate the following indefinite integrals. [1] $\int \tan ^ 3 x dx$ [2] $\int a^{mx+n}dx\ (a>0,a\neq 1, mn\neq 0)$ [3] $\int \cos ^ 5 x dx$ [4] $\int \sin ^ 2 x\cos ^ 3 x dx$ [5]$ \int \frac{dx}{\sin x}$
A finite collection of positive real numbers (not necessarily distinct) is [i]balanced [/i]if each number is less than the sum of the others. Find all $m \ge 3$ such that every balanced finite collection of $m$ numbers can be split into three parts with the property that the sum of the numbers in each part is less than the sum of the numbers in the two other parts.
How many interger tuples $(x,y,z)$ are there satisfying $0\leq x,y,z < 2011$, $xy+yz+zx \equiv 0 \pmod{2011}$, and $x+y+z \equiv 0 \pmod{2011}$ ? $\textbf{(A)}\ 2010 \qquad\textbf{(B)}\ 2011 \qquad\textbf{(C)}\ 2012 \qquad\textbf{(D)}\ 4021 \qquad\textbf{(E)}\ 4023$
We call the [i]tribi [/i] of a positive integer $k$ (denoted $T(k)$) the number of all pairs $11$ in the binary representation of $k$. e.g $$T(1)=T(2)=0,\, T(3)=1, \,T(4)=T(5)=0,\,T(6)=1,\,T(7)=2.$$ Calculate $S_n=\sum_{k=1}^{2^n}T(K)$.
How many integer solutions exist that satisfy this equation? $$x+4y-343\sqrt{x}-686\sqrt{y}+4\sqrt{xy}+2022=0$$.
A trawler is about to fish in territorial waters of a neighboring country, for what he has no licence. Whenever he throws the net, the coast-guard may stop him with the probability $1/k$, where $k$ is a fixed positive integer. Each throw brings him a fish landing of a fixed weight. However, if the coast-guard stops him, they will confiscate his entire fish landing and demand him to leave the country. The trawler plans to throw the net $n$ times before he returns to territorial waters in his country. Find $n$ for which his expected profit is maximal.
[b]8.1[/b] $x$ and $y$ are the roots of the equation $t^2-ct-c=0$. Prove that holds the inequality $x^3 + y^3 + (xy)^3 \ge 0.$ [b]8.2.[/b] Two circles touch internally at point $A$ . Through a point $B$ of the inner circle, different from $A$, a tangent to this circle intersecting the outer circle at points C and $D$. Prove that $AB$ is a bisector of angle $CAD$. [img]https://cdn.artofproblemsolving.com/attachments/2/8/3bab4b5c57639f24a6fd737f2386a5e05e6bc7.png[/img] [b]8.3[/b] Prove that $2^{3^{100}} + 1$ is divisible by $3^{101}$. [b]8.4 / 7.5[/b] An entire arc of circle is drawn through the vertices $A$ and $C$ of the rectangle $ABCD$ lying inside the rectangle. Draw a line parallel to $AB$ intersecting $BC$ at point $P$, $AD$ at point $Q$, and the arc $AC$ at point $R$ so that the sum of the areas of the figures $AQR$ and $CPR$ is the smallest. [img]https://cdn.artofproblemsolving.com/attachments/1/4/9b5a594f82a96d7eff750e15ca6801a5fc0bf1.png [/img] [b]8.5[/b] In a certain group of people, everyone has one enemy and one Friend. Prove that these people can be divided into two companies so that in every company there will be neither enemies nor friends. [b]8.6[/b] Numbers $a_1, a_2, . . . , a_{100}$ are such that $$a_1 - 2a_2 + a_3 \le 0$$ $$a_2-2a_3 + a_ 4 \le 0$$ $$...$$ $$a_{98}-2a_{99 }+ a_{100} \le 0$$ and at the same time $a_1 = a_{100}\ge 0$. Prove that all these numbers are non-negative. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988083_1967_leningrad_math_olympiad]here[/url].
$A$ and $B$ are two points in the plane $\alpha$, and line $r$ passes through points $A, B$. There are $n$ distinct points $P_1, P_2, \ldots, P_n$ in one of the half-plane divided by line $r$. Prove that there are at least $\sqrt n$ distinct values among the distances $AP_1, AP_2, \ldots, AP_n, BP_1, BP_2, \ldots, BP_n.$
Given a triangle $ABC$ with pairwise distinct sides. on his on the sides, regular triangles $ABC_1$, $BCA_1$, $CAB_1$. are constructed externally. Prove that triangle $A_1B_1C_1$ cannot be regular.
Pepito's mother wants to prepare $n$ packages of $3$ candies to give away at the birthday party, and for this she will buy assorted candies of $3$ different flavors. You can buy any number of candies but you can't choose how many of each taste. She wants to put one candy of each flavor in each package, and if this is not possible she will use only candy of one flavor and all the packages will have $3$ candies of that flavor. Determine the least number of candies that must be purchased in order to assemble the n packages. He explains why if he buys fewer candies, he is not sure that he will be able to assemble the packages the way he wants.
Let M be a subst of {1,2,...,2006} with the following property: For any three elements x,y and z (x<y<z) of M, x+y does not divide z. Determine the largest possible size of M. Justify your claim.
In the triangle $ABC$, $AA_1$ and $BB_1$ are altitudes. On the side $AB$ , points $M$ and $K$ are selected so that $B_1K \parallel BC$ and $A_1M \parallel AC$. Prove that the angle $AA_1K$ is equal to the angle $BB_1M$. (D. Prokopenko)
Call a set of 3 positive integers $\{a,b,c\}$ a [i]Pythagorean[/i] set if $a,b,c$ are the lengths of the 3 sides of a right-angled triangle. Prove that for any 2 Pythagorean sets $P,Q$, there exists a positive integer $m\ge 2$ and Pythagorean sets $P_1,P_2,\ldots ,P_m$ such that $P=P_1, Q=P_m$, and $\forall 1\le i\le m-1$, $P_i\cap P_{i+1}\neq \emptyset$.
Let $(a_k)^{\infty}_{k=0}$ be a sequence of real numbers such that if $k$ is a non-negative integer, then $$a_{k+1} = 3a_k - \lfloor 2a_k \rfloor - \lfloor a_k \rfloor.$$ Definitely all positive integers $n$ such that if $a_0 = 1/n$, then this sequence is constant after a certain term.
Suppose that $x$ and $y$ are positive real numbers such that $x^3, y^3$ and $x + y$ are all rational numbers. Show that the numbers $xy, x^2+y^2, x$ and $y$ are also rational
Suppose that the roots $p,q$ of the equation $x^2-x+c=0$ where $c \in \mathbb{R}$, are rational numbers. Prove that the roots of the equation $x^2+px-q=0$ are also rational numbers.
Vertices and Edges of a regular $n$-gon are numbered $1,2,\dots,n$ clockwise such that edge $i$ lies between vertices $i,i+1 \mod n$. Now non-negative integers $(e_1,e_2,\dots,e_n)$ are assigned to corresponding edges and non-negative integers $(k_1,k_2,\dots,k_n)$ are assigned to corresponding vertices such that: $i$) $(e_1,e_2,\dots,e_n)$ is a permutation of $(k_1,k_2,\dots,k_n)$. $ii$) $k_i=|e_{i+1}-e_i|$ indexes$\mod n$. a) Prove that for all $n\geq 3$ such non-zero $n$-tuples exist. b) Determine for each $m$ the smallest positive integer $n$ such that there is an $n$-tuples stisfying the above conditions and also $\{e_1,e_2,\dots,e_n\}$ contains all $0,1,2,\dots m$.
Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.
Let $f : (0, \infty) \to \mathbb{R}$ is differentiable such that $\lim \limits_{x \to \infty} f(x)=2019$ Then which of the following is correct? [list=1] [*] $\lim \limits_{x \to \infty} f'(x)$ always exists but not necessarily zero. [*] $\lim \limits_{x \to \infty} f'(x)$ always exists and is equal to zero. [*] $\lim \limits_{x \to \infty} f'(x)$ may not exist. [*] $\lim \limits_{x \to \infty} f'(x)$ exists if $f$ is twice differentiable. [/list]
Let $ABC$ be a triangle, and let $T$ be a point on the extension of $AB$ beyond $B$, and $U$ a point on the extension of $AC$ beyond $C$, such that $BT = CU$. Moreover, let $R$ and $S$ be points on the extensions of $AB$ and $AC$ beyond $A$ such that $AS = AT$ and $AR = AU$. Prove that $R$, $S$, $T$, $U$ lie on a circle whose centre lies on the circumcircle of $ABC$.