We say that a subset \( T \) of \(\{1, 2, \dots, 2024\}\) is [b]kawaii[/b] if \( T \) has the following properties: 1. \( T \) has at least two distinct elements; 2. For any two distinct elements \( x \) and \( y \) of \( T \), \( x - y \) does not divide \( x + y \). For example, the subset \( T = \{31, 71, 2024\} \) is [b]kawaii[/b], but \( T = \{5, 15, 75\} \) is not [b]kawaii[/b] because \( 15 - 5 = 10 \) divides \( 15 + 5 = 20 \). What is the largest possible number of elements that a [b]kawaii [/b]subset can have?

Connect the commom points of circle$x^2+(y-1)^2=1$ and ellipse $9x^2+(y+1)^2=9$ with line segments, the figure is a $\text{(A)}$ line segment $\text{(B)}$ scalene triangle $\text{(C)}$ equilateral triangle $\text{(D)}$ quadrilateral

A paper cup has a base that is a circle with radius $r$, a top that is a circle with radius $2r$, and sides that connect the two circles with straight line segments as shown below. This cup has height $h$ and volume $V$. A second cup that is exactly the same shape as the first is held upright inside the first cup so that its base is a distance of $\tfrac{h}2$ from the base of the first cup. The volume of liquid that will t inside the first cup and outside the second cup can be written $\tfrac{m}{n}\cdot V$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] pair s = (10,1); draw(ellipse((0,0),4,1)^^ellipse((0,-6),2,.5)); fill((3,-6)--(-3,-6)--(0,-2.1)--cycle,white); draw((4,0)--(2,-6)^^(-4,0)--(-2,-6)); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-2.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); pair s = (10,-2); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-4.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); //darn :([/asy]

Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]

For which integers $n \geq 3$ does there exist a regular $n$-gon in the plane such that all its vertices have integer coordinates in a rectangular coordinate system?

Fix an integer $n \geq 2$. An $n\times n$ sieve is an $n\times n$ array with $n$ cells removed so that exactly one cell is removed from every row and every column. A stick is a $1\times k$ or $k\times 1$ array for any positive integer $k$. For any sieve $A$, let $m(A)$ be the minimal number of sticks required to partition $A$. Find all possible values of $m(A)$, as $A$ varies over all possible $n\times n$ sieves. [i]Palmer Mebane[/i]

A circle is inscribed in the trapezoid [i]ABCD[/i]. Let [i]K, L, M, N[/i] be the points of tangency of this circle with the diagonals [i]AC[/i] and [i]BD[/i], respectively ([i]K[/i] is between [i]A[/i] and [i]L[/i], and [i]M[/i] is between [i]B[/i] and [i]N[/i]). Given that $AK\cdot LC=16$ and $BM\cdot ND=\frac94$, find the radius of the circle. [color=red][Moderator edit: A solution of this problem can be found on http://www.ajorza.org/math/mathfiles/scans/belarus.pdf , page 20 (the statement of the problem is on page 6). The author of the problem is I. Voronovich.][/color]

A plane flew straight against a wind between two towns in 84 minutes and returned with that wind in 9 minutes less than it would take in still air. The number of minutes (2 answers) for the return trip was $ \textbf{(A)}\ 54 \text{ or } 18 \qquad \textbf{(B)}\ 60 \text{ or } 15 \qquad \textbf{(C)}\ 63 \text{ or } 12 \qquad \textbf{(D)}\ 72 \text{ or } 36 \qquad \textbf{(E)}\ 75 \text{ or } 20$

The diagram below shows four congruent squares and some of their diagonals. Let $T$ be the number of triangles and $R$ be the number of rectangles that appear in the diagram. Find $T + R$. [img]https://cdn.artofproblemsolving.com/attachments/1/5/f756bbe67c09c19e811011cb6b18d0ff44be8b.png[/img]

Denote by $S$ the set of all primes $p$ such that the decimal representation of $\frac{1}{p}$ has the fundamental period of divisible by $3$. For every $p \in S$ such that $\frac{1}{p}$ has the fundamental period $3r$ one may write \[\frac{1}{p}= 0.a_{1}a_{2}\cdots a_{3r}a_{1}a_{2}\cdots a_{3r}\cdots,\] where $r=r(p)$. For every $p \in S$ and every integer $k \ge 1$ define \[f(k, p)=a_{k}+a_{k+r(p)}+a_{k+2r(p)}.\] [list=a] [*] Prove that $S$ is finite. [*] Find the highest value of $f(k, p)$ for $k \ge 1$ and $p \in S$.[/list]

Evaluate \[\sum_{n=1}^{\infty} \int_{2n\pi}^{2(n+1)\pi} \frac{x\sin x+\cos x}{x^2}\ dx\ (n=1,2,\cdots)\]

Prove $ \ \ \ \frac{22}{7}\minus{}\pi \equal{}\int_0^1 \frac{x^4(1\minus{}x)^4}{1\plus{}x^2}\ dx$.

Let $n\ge 3$, $d$ be positive integers. For an integer $x$, denote $r(x)$ be the remainder of $x$ when divided by $n$ such that $0\le r(x)\le n-1$. Let $c$ be a positive integer with $1<c<n$ and $\gcd(c,n)=1$, and suppose $a_1, \cdots, a_d$ are positive integers with $a_1+\cdots+a_d\le n-1$. \\ (a) Prove that if $n<2d$, then $\displaystyle\sum_{i=1}^d r(ca_i)\ge n.$ \\ (b) For each $n$, find the smallest $d$ such that $\displaystyle\sum_{i=1}^d r(ca_i)\ge n$ always holds. [i]Proposed by Yeoh Zi Song & Anzo Teh Zhao Yang[/i]

In the figure, point $P, Q,R,S$ lies on the side of the rectangle $ABCD$. [img]https://1.bp.blogspot.com/-Ff9rMibTuHA/X9PRPbGVy-I/AAAAAAAAMzA/2ytG0aqe-k0fPL3hbSp_zHrMYAfU-1Y_ACLcBGAsYHQ/s426/2020%2BIndonedia%2BMO%2BProvince%2BP2%2Bq1.png[/img] If it is known that the area of the small square is $1$ unit, determine the area of the rectangle $ABCD$.

Find the smallest positive integer $n$ such that $32^n = 167x + 2$ for some integer $x$

Find all natural numbers $n$ for which there exists a convex polyhedron satisfying the following conditions: (i) Each face is a regular polygon. (ii) Among the faces, there are polygons with at most two different numbers of edges. (iii) There are two faces with common edge that are both $n$-gons.

What is the value of $$(2^2-2) - (3^2-3) + (4^2-4)?$$ $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 8 \qquad \textbf{(E) } 12$

Consider triangle $ABC$ with orthocenter $H$. Let points $M$ and $N$ be the midpoints of segments $BC$ and $AH$. Point $D$ lies on line $MH$ so that $AD\parallel BC$ and point $K$ lies on line $AH$ so that $DNMK$ is cyclic. Points $E$ and $F$ lie on lines $AC$ and $AB$ such that $\angle EHM=\angle C$ and $\angle FHM=\angle B$. Prove that points $D,E,F$ and $K$ lie on a circle. [i]Proposed by Alireza Dadgarnia[/i]

There are 2014 houses in a circle. Let $A$ be one of these houses. Santa Claus enters house $A$ and leaves a gift. Then with probability $1/2$ he visits $A$'s left neighbor and with probability $1/2$ he visits $A$'s right neighbor. He leaves a gift also in that second house, and then repeats the procedure (visits with probability $1/2$ either of the neighbors, leaves a gift, etc). Santa finishes as soon as every house has received at least one gift. Prove that any house $B$ different from $A$ has a probability of $1/2013$ of being the last house receiving a gift.

Let $ABCD$ be a square of side $a$. On side $AD$ consider points $E$ and $Z$ such that $DE=a/3$ and $AZ=a/4$. If the lines $BZ$ and $CE$ intersect at point $H$, calculate the area of the triangle $BCH$ in terms of $a$.

Given triangle $ABC$, $D$ is the foot of the external angle bisector of $A$, $I$ its incenter and $I_a$ its $A$-excenter. Perpendicular from $I$ to $DI_a$ intersects the circumcircle of triangle in $A'$. Define $B'$ and $C'$ similarly. Prove that $AA',BB'$ and $CC'$ are concurrent. [i]proposed by Amirhossein Zabeti[/i]

Show that for $n\ge 5$, a cross-section of a pyramid whose base is a regular $n$-gon cannot be a regular $(n + 1)$-gon. [i]N. Agakhanov, N. Tereshin[/i]

We take $100$ consecutive natural numbers $a_{1},$ $a_{2},$ $...,$ $a_{100}.$ Determine the last two digits of the number $a_{1}^{8}+a_{2}^{8}+...+a_{100}^{8}.$

Consider the set $S = \{1, 2, . . . , 2015\}$. How many ways are there to choose $2015$ distinct (possibly empty and possibly full) subsets $X_1, X_2, . . . , X_{2015}$ of $S$ such that $X_i$ is strictly contained in $X_{i+1}$ for all $1 \le i \le 2014$?

For a randomly selected permutation $ \mathbf{f} = (f_1,..., f_n) $ of the set $ \{1,\ldots, n\} $ let us denote by $ X(\mathbf{f}) $ the largest number $ k \leq n $ such that $ f_i < f_{ i+1} $ for all numbers $ i < k $. Prove that the expected value of the random variable $ X $ is $ \sum_{k=1}^n \frac{1}{k!} $.