$Abdulqodir$ cut out $2024$ congruent regular $n-$gons from a sheet of paper and placed these $n-$gons on the table such that some parts of each of these $n-$gons may be covered by others. We say that a vertex of one of the afore-mentioned $n-$gons is $visible$ if it is not in the interior of another $n-$gon that is placed on top of it. For any $n>2$ determine the minimum possible number of visible vertices. \\ Proposed by David Hrushka, Slovakia

Let $n$ be a positive integer. - Find, in terms of $n$, the number of pairs $(x,y)$ of positive integers that are solutions of the equation : $$x^2-y^2=10^2.30^{2n}$$ - Prove further that this number is never a square

[b]p1.[/b] Insert "$+$" signs between some of the digits in the following sequence to obtain correct equality: $$1\,\,\,\, 2\,\,\,\, 3\,\,\,\, 4\,\,\,\,5\,\,\,\, 6\,\,\,\, 7 = 100$$ [b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm. [img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img] [b]p3.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. $\frac25$ of his drink is orange juice and the rest is apple juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $\frac35$ of orange juice? [b]p4.[/b] A train moving at $55$ miles per hour meets and is passed by a train moving moving in the opposite direction at $35$ miles per hour. A passenger in the first train sees that the second train takes $8$ seconds to pass him. How long is the second train? [b]p5.[/b] It is easy to arrange $16$ checkers in $10$ rows of $4$ checkers each, but harder to arrange $9$ checkers in $10$ rows of $3$ checkers each. Do both. [b]p6.[/b] Every human that lived on Earth exchanged some number of handshakes with other humans. Show that the number of people that made an odd number of handshakes is even. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$$\int_0^1 x\ln(x^2)\ln(1+x)\,dx$$ [i]Proposed by Connor Gordon[/i]

Find all pairs of nonnegative integers $(m,n)$ such that \[(m+n-5)^2=9mn.\]

From all possible permutations from $(a_1,a_2,...,a_n)$ from the set $\{1,2,..,n\}$, $n\geq 1$, consider the sets that satisfies the $2(a_1+a_2+...+a_m)$ is divisible by $m$, for every $m=1,2,...,n$. Find the total number of permutations.

What is the probability that a randomly drawn positive factor of $ 60$ is less than $ 7$? $ \textbf{(A)}\ \frac{1}{10} \qquad \textbf{(B)}\ \frac{1}{6} \qquad \textbf{(C)}\ \frac{1}{4} \qquad \textbf{(D)}\ \frac{1}{3} \qquad \textbf{(E)}\ \frac{1}{2}$

In a triangle $ABC$ with $AC\ne BC$, $M$ is the midpoint of $AB$ and $\angle A=\alpha$, $\angle B=\beta$, $\angle ACM=\varphi$ and $\angle BSM=\Psi$. Prove that $$\frac{\sin\alpha\sin\beta}{\sin(\alpha-\beta)}=\frac{\sin\varphi\sin\Psi}{\sin(\varphi-\Psi)}.$$

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ that satisfy the conditions \[f(1+xy)-f(x+y)=f(x)f(y) \quad \text{for all } x,y \in \mathbb{R},\] and $f(-1) \neq 0$.

In a social network with a fixed finite setback of users, each user had a fixed set of [i]followers[/i] among the other users. Each user has an initial positive integer rating (not necessarily the same for all users). Every midnight, the rating of every user increases by the sum of the ratings that his followers had just before midnight. Let $m$ be a positive integer. A hacker, who is not a user of the social network, wants all the users to have ratings divisible by $m$. Every day, he can either choose a user and increase his rating by 1, or do nothing. Prove that the hacker can achieve his goal after some number of days. [i]Vladislav Novikov[/i]

The evil sorceress Morgana lives in a square-shaped palace divided into a \(101 \times 101\) grid of rooms, each initially at a temperature of \(20^\circ\)C. Merlin attempts to freeze Morgana by casting a spell that permanently sets the central cell's temperature to \(0^\circ\)C. At each subsequent nanosecond, the following steps occur in order: 1. For every cell except the central one, the new temperature is computed as the arithmetic mean of the temperatures of its adjacent cells (those sharing a side). 2. All new temperatures (except the central cell) are updated simultaneously to the calculated values. Morgana can freely move between rooms but will freeze if all room temperatures drop below \(10^{-2025}\) degrees. The ice spell lasts for \(10^{75}\) nanoseconds, after which temperatures revert to their initial values. Will Merlin succeed in freezing Morgana?

Assume that the connected graph $G$ has $n$ vertices all with degree at least three. Prove that there exists a spanning tree of $G$ with more than $\frac{2}{9}n$ leaves.

A circle $\omega$ is inscribed in a quadrilateral $ABCD$. Let $I$ be the center of $\omega$. Suppose that \[ (AI + DI)^2 + (BI + CI)^2 = (AB + CD)^2. \] Prove that $ABCD$ is an isosceles trapezoid.

If $a,b,c$ are real numbers and $(a+b-5)^2+(b+2c+3)^2+(c+3a-10)^2=0$ find the integer nearest to $a^3+b^3+c^3$.

Given an inscribed pentagon $ABCDE$ with circumcircle $\Gamma$. Line $\ell$ passes through vertex $A$ and is tangent to $\Gamma$. Points $X,Y$ lie on $\ell$ so that $A$ lies between $X$ and $Y$. Circumcircle of triangle $XED$ intersects segment $AD$ at $Q$ and circumcircle of triangle $YBC$ intersects segment $AC$ at $P$. Lines $XE,YB$ intersects each other at $S$ and lines $XQ, Y P$ at $Z$. Prove that circumcircle of triangles $XY Z$ and $BES$ are tangent.

Let $A$ be a set of positive integers with at least 2 elements. It is given that for any numbers $a>b$, $a,b \in A$ we have $\frac{ [a,b] }{ a- b } \in A$, where by $[a,b]$ we have denoted the least common multiple of $a$ and $b$. Prove that the set $A$ has [i]exactly[/i] two elements. [i]Marius Gherghu, Slatina[/i]