There is a test for the dangerous bifurcation virus that is $ 99\%$ accurate. In other words, if someone has the virus, there is a $ 99\%$ chance that the test will be positive, and if someone does not have it, then there is a $ 99\%$ chance the test will be negative. Assume that exactly $ 1\%$ of the general population has the virus. Given an individual that has tested positive from this test, what is the probability that he or she actually has the disease? Express your answer as a percentage.

Fix integers $n\geq 2$ and $1\leq m\leq n-1$. Let $a_0, a_1, \dots, a_n$ be non-negative real numbers satisfying $a_0+a_1+\dots +a_n=1$. Prove that, if $\sum_{k=0}^n a_kx^k < x^m$ for some $0<x<1$, then $$\sum_{k=0}^{m-1}(m-k)a_k < \sum_{k=m+1}^n (k-m)a_k.$$

Let $ABCD$ be a fixed convex quadrilateral. Say a point $K$ is [i]pastanaga[/i] if there's a rectangle $PQRS$ centered at $K$ such that $A\in PQ, B\in QR, C\in RS, D\in SP$. Prove there exists a circle $\omega$ depending only on $ABCD$ that contains all pastanaga points.

Determine the number of digits $1$ in the integer part of $\frac{10^{1992}}{10^{83}+7}$.

$ABCD$ is a convex quadrilateral. $P$ is the intersection of external bisectors of $\angle DAC$ and $\angle DBC$. Prove that $\angle APD = \angle BPC$ if and only if $AD+AC=BC+BD$

A competition consists of $25$ sports, each awarding one gold medal to a winner. $25$ athletes participate, each in all $25$ sports. There are also $25$ experts, each of whom must predict the number of gold medals each athlete will win. In each prediction, the medal counts must be non-negative integers summing to $25$. An expert is called competent if they correctly guess the number of gold medals for at least one athlete. What is the maximum number \( k \) such that the experts can make their predictions so that at least \( k \) of them are guaranteed to be competent regardless of the outcome? \\

Find the least number which is divisible by 2009 and its sum of digits is 2009.

Let define a function $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that : $i)$$f(p)=1$ for all prime numbers $p$. $ii)$$f(xy)=xf(y)+yf(x)$ for all positive integers $x,y$ find the smallest $n \geq 2016$ such that $f(n)=n$

Set positive integer $m=2^k\cdot t$, where $k$ is a non-negative integer, $t$ is an odd number, and let $f(m)=t^{1-k}$. Prove that for any positive integer $n$ and for any positive odd number $a\le n$, $\prod_{m=1}^n f(m)$ is a multiple of $a$.

A mustache is created by taking the set of points $(x, y)$ in the $xy$-coordinate plane that satisfy $4 + 4 \cos(\pi x/24) \le y \le 6 + 6\cos(\pi x/24)$ and $-24 \le x \le 24$. What is the area of the mustache?

Given two positive integers $x,y$, we define $z=x\,\oplus\,y$ to be the bitwise XOR sum of $x$ and $y$; that is, $z$ has a $1$ in its binary representation at exactly the place values where $x,y$ have differing binary representations. It is known that $\oplus$ is both associative and commutative. For example, $20 \oplus 18 = 10100_2 \oplus 10010_2 = 110_2 = 6$. Given a set $S=\{a_1, a_2, \dots, a_n\}$ of positive integers, we let $f(S) = a_1 \oplus a_2 \oplus a_3\oplus \dots \oplus a_n$. We also let $g(S)$ be the number of divisors of $f(S)$ which are at most $2018$ but greater than or equal to the largest element in $S$ (if $S$ is empty then let $g(S)=2018$). Compute the number of $1$s in the binary representation of $\displaystyle\sum_{S\subseteq \{1,2,\dots, 2018\}} g(S)$. [i]Proposed by Brandon Wang and Vincent Huang

Let $ABCD$ be a convex quadrilateral. We assume that there exists a point $P$ inside the quadrilateral such that the areas of the triangles $ABP, BCP, CDP$, and $DAP$ are equal. Show that at least one of the diagonals of the quadrilateral bisects the other diagonal.

Consider the polynomial $P(x)=X^{2n}-X^{2n-1}+\dots-x+1$, where $n\in{N^*}$. Find the remainder of the division of polynomial $P(x^{2n+1})$ by $P(x)$.

Let $k$ be a positive integer, and let $a,b$ and $c$ be positive real numbers. Show that \[a(1-a^k)+b(1-(a+b)^k)+c(1-(a+b+c)^k)<\frac{k}{k+1}.\] [i]* * *[/i]

Let $x$ be a real number. Suppose that there exist integers $a_0,a_1,\dots,a_n$, not all zero, such that \[\sum_{k=0}^n a_k\cos(kx)=\sum_{k=0}^na_k\sin(kx)=0.\] Characterize all possible values of $\cos x$. [i]Grisham Paimagam[/i]

An arithmetic sequence consists of $ 200$ numbers that are each at least $ 10$ and at most $ 100$. The sum of the numbers is $ 10{,}000$. Let $ L$ be the [i]least[/i] possible value of the $ 50$th term and let $ G$ be the [i]greatest[/i] possible value of the $ 50$th term. What is the value of $ G \minus{} L$?

A convex, closed figure lies inside a given circle. The figure is seen from every point of the circumference at a right angle (that is, the two rays drawn from the point and supporting the convex figure are perpendicular). Prove that the center of the circle is a center of symmetry of the figure.

Let $C$ be the left vertex of the ellipse $\frac{x^2}8+\frac{y^2}4 = 1$ in the Cartesian Plane. For some real number $k$, the line $y=kx+1$ meets the ellipse at two distinct points $A, B$. (i) Compute the maximum of $|CA|+|CB|$. (ii) Let the line $y=kx+1$ meet the $x$ and $y$ axes at $M$ and $N$, respectively. If the intersection of the perpendicular bisector of $MN$ and the circle with diameter $MN$ lies inside the given ellipse, compute the range of possible values of $k$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 12)[/i]

Freddy the frog is jumping around the coordinate plane searching for a river, which lies on the horizontal line $y = 24$. A fence is located at the horizontal line $y = 0$. On each jump Freddy randomly chooses a direction parallel to one of the coordinate axes and moves one unit in that direction. When he is at a point where $y=0$, with equal likelihoods he chooses one of three directions where he either jumps parallel to the fence or jumps away from the fence, but he never chooses the direction that would have him cross over the fence to where $y < 0$. Freddy starts his search at the point $(0, 21)$ and will stop once he reaches a point on the river. Find the expected number of jumps it will take Freddy to reach the river.

Ants, named Anna and Bob, are located at vertices \(A\) and \(B\) respectively of a cube \(ABCD A_1 B_1 C_1 D_1\), with a sugar cube placed at vertex \(C_1\). It is known that Bob can move at a speed of $20$ meters per minute. Determine the minimum speed in integer meters per minute that Anna must be able to travel in order to reach the sugar cube at \(C_1\) before Bob. [i]Proposed by Tamar Turashvili, Georgia [/i]

Find all positive integers $n$ and prime numbers $p$ such that $$17^n \cdot 2^{n^2} - p =(2^{n^2+3}+2^{n^2}-1) \cdot n^2.$$ [i]Authored by Nikola Velov[/i]

Aurick has a cup, a right cone with a circular base of radius $\frac12$, filled with milk tea. The slant height of the cup is $1$, and the tea fills the cup $\frac12$ of the way up the cup’s side. Suppose that Aurick tips the cup just to the point of spilling, as shown in the diagram. The new slant height EA and the tilted tea surface’s major axis $ET$ form $\angle T EA$. Compute $\cos(\angle T EA)$. [img]https://cdn.artofproblemsolving.com/attachments/e/e/76e12ee31ce4ba8a5daaf0f5538b98726a0d37.png[/img]

In the quadrilateral $ABCD$, we have $AB = AD$ and $\angle B = \angle D = 90 ^ \circ $. The points $P$ and $Q $ lie on $BC$ and $CD$, respectively, so that $AQ$ is perpendicular on $DP$. Prove that $AP$ is perpendicular to $BQ$.

In the plane, $\Gamma$ is a circle with centre $O$ and radius $r, P$ and $Q$ are distinct points on $\Gamma , A$ is a point outside $\Gamma , M$ and $N$ are the midpoints of $PQ$ and $AO$ respectively. Suppose$ OA = 2a$ and $\angle PAQ$ is a right angle. Find the length of $MN$ in terms of $r$ and $a$. Express your answer in its simplest form, and justify your answer.

Let $a,b,c \in \mathbb{C}$ such that $a|bc| + b|ca| + c|ab| = 0$. Prove that $|(a-b)(b-c)(c-a)| \ge 3\sqrt{3}|abc|$.