Alice and Bob are playing a guessing game. Bob is thinking of a number n of the form $2^a3^b$, where a and b are positive integers between $ 1$ and $2020$, inclusive. Each turn, Alice guess a number m, and Bob will tell her either $\gcd (m, n)$ or $lcm (m, n)$ (letting her know that he is saying that $gcd$ or $lcm$), as well as whether any of the respective powers match up in their prime factorization. In particular, if $m = n$, Bob will let Alice know this, and the game is over. Determine the smallest number $k$ so that Alice is always able to find $n$ within $k$ guesses, regardless of Bob’s number or choice of revealing either the $lcm$, or the $gcd$ .

Let $p(x)$ be a polynomial of degree strictly less than $100$ and such that it does not have $(x^3-x)$ as a factor. If $$\frac{d^{100}}{dx^{100}}\bigg(\frac{p(x)}{x^3-x}\bigg)=\frac{f(x)}{g(x)}$$ for some polynomials $f(x)$ and $g(x)$ then find the smallest possible degree of $f(x)$.

$a$, $b$, $c$ are real numbers. Show that $\min((a-b)^2,(b-c)^2,(c-a)^2)\leq \frac{a^2+b^2+c^2}{2}$

From a point $ M $ on the surface of a sphere, three mutually perpendicular chords $ MA $, $ MB $, $ MC $ are drawn. Prove that the segment joining the point $ M $ with the center of the sphere intersects the plane of the triangle $ ABC $ at the center of gravity of this triangle.

Let $ f(x)$ be a $ n \minus{}$degree polynomial all of whose coefficients are equal to $ \pm 1$, and having $ x \equal{} 1$ as its $ m$ multiple root. If $ m\ge 2^k (k\ge 2,k\in N)$, then $ n\ge 2^{k \plus{} 1} \minus{} 1.$

Find all natural numbers $ n$ for which every natural number whose decimal representation has $ n \minus{} 1$ digits $ 1$ and one digit $ 7$ is prime.

Given a set $P$ of $n>100$ points on the plane such that no three of them are collinear, and a set $S$ of $20n$ distinct segments, each joining a pair of points from $P$. Prove that there exists a line not passing through a point from $P$ and intersecting at least $200$ segments from $S$.

A line through the vertex $A{}$ of the triangle $ABC{}$ which doesn't coincide with $AB{}$ or $AC{}$ intersectes the altitudes from $B{}$ and $C{}$ at $D{}$ and $E{}$ respectively. Let $F{}$ be the reflection of $D{}$ in $AB{}$ and $G{}$ be the reflection of $E{}$ in $AC{}.$ Prove that the circles $ABF{}$ and $ACG{}$ are tangent.

Define a positive integer $n$ to be [i]almost-cubic [/i] if it becomes a perfect cube upon concatenating the digit $5$. For example, $12$ is almost-cubic because $125 = 5^3$. Find the remainder when the sum of all almost-cubic $n < 10^8$ is divided by $1000$.

Is it possible to color each square on a $9\times 9$ board so that each $2\times 3$ or $3\times 2$ block contains exactly $2$ black squares? If so, what is/are the possible total number(s) of black squares?

There are $n \ge 4$ cities on a round lake, between which $n -4$ people travel and one green drivers operate. Each ferry connects two non-adjacent cities, and itself do not cross two driving routes so that collisions can be avoided. In order to better adapt the transport routes to the needs of the passengers, the following change can be done: A new route can be assigned to any driver. The routes of the remaining drives must not cross and also must not be changed at the same time. Let Santa Marta and Cape Town be two non-adjacent cities. Show that you have finitely many route changes so that the Green Driver will operate between Santa Marta and Cape Town after these changes. Note: At no time may two trips between the same cities or one drive between two neighboring cities. [hide=original wording]An einem runden See liegen $n >= 4$ Stadte, zwischen denen $n - 4$ Personenfahren und eine grune Autofahre verkehren. Jede Fahre verbindet zwei nicht benachbarte Stadte, wobei sich keine zwei Fahrenrouten uberkreuzen, damit Kollisionen vermieden werden konnen. Um die Transportrouten besser den Bedurfnissen der Passagiere anzupassen, kann folgende Anderung vorgenommen werden: Einer beliebigen Fahre kann eine neue Route zugeordnet werden. Dabei durfen die Routen der restlichen Fahren nicht uberkreuzt und auch nicht gleichzeitig verandert werden. Seien Santa Marta und Kapstadt zwei nicht benachbarte Stadte. Zeige, dass man endlich viele Routenanderungen vornehmen kann, sodass die grune Autofahre nach diesen Anderungen zwischen Santa Marta und Kapstadt verkehrt. Bemerkung: Zu keinem Zeitpunkt durfen zwei Fahren zwischen denselben Stadten oder eine Fahre zwischen zwei benachbarten Stadten verkehren.[/hide]

[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/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]p4.[/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? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be an acute triangle, $H$ its orthocentre, $D$ a point on the side $[BC]$, and $P$ a point such that $ADPH$ is a parallelogram. Show that $\angle BPC > \angle BAC$.

Hi everybody! I've an interesting problem! Can you solve it? Prove [b]Erdös-Ginzburg-Ziv Theorem[/b]: [i]"Among any $2n-1$ integers, there are some $n$ whose sum is divisible by $n$."[/i]

It is given triangle $ABC$ and points $P$ and $Q$ on sides $AB$ and $AC$, respectively, such that $PQ\mid\mid BC$. Let $X$ and $Y$ be intersection points of lines $BQ$ and $CP$ with circumcircle $k$ of triangle $APQ$, and $D$ and $E$ intersection points of lines $AX$ and $AY$ with side $BC$. If $2\cdot DE=BC$, prove that circle $k$ contains intersection point of angle bisector of $\angle BAC$ with $BC$

A roll of tape is $4$ inches in diameter and is wrapped around a ring that is $2$ inches in diameter. A cross section of the tape is shown in the figure below. The tape is $0.015$ inches thick. If the tape is completely unrolled, approximately how long would it be? Round your answer to the nearest $100$ inches. [asy] /* AMC8 P22 2024, revised by Teacher David */ size(120); pair o = (0,0); real r1 = 1; real r2 = 2; filldraw(circle(o, r2), mediumgray, linewidth(1pt)); filldraw(circle(o, r1), white, linewidth(1pt)); draw((-2,-2.6)--(-2,-2.4)); draw((2,-2.6)--(2,-2.4)); draw((-2,-2.5)--(2,-2.5), L=Label("4 in.")); draw((-1,0)--(1,0), L=Label("2 in.", align=(0,1)), arrow=Arrows()); draw((2,0)--(2,-1.3), linewidth(1pt)); [/asy] $\textbf{(A) } 300\qquad\textbf{(B) } 600\qquad\textbf{(C) } 1200\qquad\textbf{(D) } 1500\qquad\textbf{(E) } 1800$

If $A$ and $B$ are vertices of a polyhedron, define the [i]distance[/i] $d(A, B)$ to be the minimum number of edges of the polyhedron one must traverse in order to connect $A$ and $B$. For example, if $\overline{AB}$ is an edge of the polyhedron, then $d(A, B) = 1$, but if $\overline{AC}$ and $\overline{CB}$ are edges and $\overline{AB}$ is not an edge, then $d(A, B) = 2$. Let $Q$, $R$, and $S$ be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that $d(Q, R) > d(R, S)$? $\textbf{(A)}~\frac{7}{22}\qquad\textbf{(B)}~\frac13\qquad\textbf{(C)}~\frac38\qquad\textbf{(D)}~\frac5{12}\qquad\textbf{(E)}~\frac12$

Let $ABC$ be an acute scalene triangle with incenter $I$, circumcircle $w_1$, and denote the circumcircle of $BIC$ as $w_2$. Suppose point $P$ lies on $w_2$ and is inside $w_1$. Let $X,Y$ lie on $BC$ with $XP \perp BP, YP \perp PC$. Circles $O_1, O_2$ are drawn tangent to $w_1$ at points on the same side of $BC$ as $A$ and tangent to $BC$ at $X,Y$ respectively. Let the centers of those two circles be $Z_1, Z_2$. Let $D$ be the point on $w_2$ opposite to $P$ and let $E$ be the foot of the altitude from $P$ to $BC$. Show that $DE \perp Z_1Z_2$

Let be three positive real numbers $ a,b,c, $ a natural number $ n, $ and the functions $ f:\mathbb{R}\longrightarrow\mathbb{R} ,g:(0,\infty )\longrightarrow\mathbb{R} $ defined as: $$ f(x)=\frac{2(n+1)x^n(x^{n+1}-a) +nx^{n+1} +2a^2x+a}{x^{2n+2}-2ax^{n+1} +a^2x^2+a^2} , $$ $$ g(x)=\frac{a+bx^n}{x+cx^{2n+1}} $$ Calculate the antiderivatives of $ f $ and $ g. $ [i]Nicolae Sanda[/i]

Let $a$, $b$ and $c$ are integers such that $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}=3$. Prove that $abc$ is a perfect cube of an integer.

In triangle $ABC$, circle $\omega$ with center $O$ passes through $B$ and $C$ and it intersects segments $\overline{AB}$ and $\overline{AC}$ again at $B^{\prime}$ and $C^{\prime}$, respectively. Suppose the circles with diameters $\overline{BB^{\prime}}$ and $\overline{CC^{\prime}}$ are externally tangent to each other at $T$ with $AB=18$, $AC=36$, and $AT=12$. Find $AO$.

A square of side $N=n^2+1$, $n\in \mathbb{N}^*$, is partitioned in unit squares (of side $1$), along $N$ rows and $N$ columns. The $N^2$ unit squares are colored using $N$ colors, $N$ squares with each color. Prove that for any coloring there exists a row or a column containing unit squares of at least $n+1$ colors.

The expression \[ \pm \Box \pm \Box \pm \Box \pm \Box \pm \Box \pm \Box \] is written on the blackboard. Two players, $ A $ and $ B $, play a game, taking turns. Player $ A $ takes the first turn. In each turn, the player on turn replaces a symbol $ \Box $ by a positive integer. After all the symbols $\Box$ are replace, player $A$ replaces each of the signs $\pm$ by either + or -, independently of each other. Player $ A $ wins if the value of the expression on the blackboard is not divisible by any of the numbers $ 11, 12, \cdots, 18 $. Otherwise, player $ B$ wins. Determine which player has a winning strategy.

Let $ \Omega$ be the circumcircle of triangle $ ABC$. Let $ D$ be the point at which the incircle of $ ABC$ touches its side $ BC$. Let $ M$ be the point on $ \Omega$ such that the line $ AM$ is parallel to $ BC$. Also, let $ P$ be the point at which the circle tangent to the segments $ AB$ and $ AC$ and to the circle $ \Omega$ touches $ \Omega$. Prove that the points $ P$, $ D$, $ M$ are collinear.

$32$ teams, ranked $1$ through $32$, enter a basketball tournament that works as follows: the teams are randomly paired and in each pair, the team that loses is out of the competition. The remaining $16$ teams are randomly paired, and so on, until there is a winner. A higher ranked team always wins against a lower-ranked team. If the probability that the team ranked $3$ (the third-best team) is one of the last four teams remaining can be written in simplest form as $\dfrac{m}{n}$, compute $m+n$.