Let $a,b$ be real numbers such that the equation $x^3-ax^2+bx-a=0$ has three positive real roots . Find the minimum of $\frac{2a^3-3ab+3a}{b+1}$.

Three cards, only one of which is an ace, are placed face down on a table. You select one, but do not look at it. The dealer turns over one of the other cards, which is not the ace (if neither are, he picks one of them randomly to turn over). You get a chance to change your choice and pick either of the remaining two face-down cards. If you selected the cards so as to maximize the chance of finding the ace on the second try, what is the probability that you selected it on the    (a) first try?    (b) second try?

For a positive integer $n$, let $S(n)$ be the sum of its decimal digits. Determine the smallest positive integer $n$ for which $4 \cdot S(n)=3 \cdot S(2n)$.

What is the value of $ \sum_{n=1}^\infty (\tan^{-1}\sqrt{n}-\tan^{-1}\sqrt{n+1})$?

Over the sides of an equilateral triangle with area $ 1$ are triangles with the opposite angle $ 60^{\circ}$ to each side drawn outside of the triangle. The new corners are $ P$, $ Q$ and $ R$. (and the new triangles $ APB$, $ BQC$ and $ ARC$) 1)What is the highest possible area of the triangle $ PQR$? 2)What is the highest possible area of the triangle whose vertexes are the midpoints of the inscribed circles of the triangles $ APB$, $ BQC$ and $ ARC$?

Find the least positive integer $n$ such that when $3^n$ is written in base $143$, its two right-most digits in base $143$ are $01$.

[asy]size(100); draw((0,0)--(1,0)--(1,1)--(1,2)--(2,2)--(2,3)--(2,4)--(1,4)--(1,3)--(0,3)--(-1,3)--(-1,2)--(0,2)--(0,1)--cycle); draw((0,1)--(1,1)); draw((0,2)--(1,2)); draw((0,2)--(0,3)); draw((1,2)--(1,3)); draw((1,3)--(2,3)); label("Z",(0.5,0.2),N); label("X",(0.5,1.2),N); label("V",(0.5,2.2),N); label("U",(-0.5,2.2),N); label("W",(1.5,2.2),N); label("Y",(1.5,3.2),N);[/asy] A piece of paper containing six joined squares labeled as shown in the diagram is folded along the edges of the squares to form a cube. The label of the face opposite the face labeled $ \text{X}$ is: \[ \textbf{(A)}\ \text{Z} \qquad \textbf{(B)}\ \text{U} \qquad \textbf{(C)}\ \text{V} \qquad \textbf{(D)}\ \text{W} \qquad \textbf{(E)}\ \text{Y} \]

$f(x)$ is square polynomial and $a \neq b$ such that $f(a)=b,f(b)=a$. Prove that there is not other pair $(c,d)$ that $f(c)=d,f(d)=c$

Let $ABC$ be an acute triangle with $AB=AC$, let $D$ be the midpoint of the side $AC$, and let $\gamma$ be the circumcircle of the triangle $ABD$. The tangent of $\gamma$ at $A$ crosses the line $BC$ at $E$. Let $O$ be the circumcenter of the triangle $ABE$. Prove that midpoint of the segment $AO$ lies on $\gamma$. [i]Proposed by Sam Bealing, United Kingdom[/i]

Prove that $\sqrt {1+\sqrt {2+\ldots +\sqrt {n}}}<2$, $\forall n\ge 1$.

Given an acute-angled triangle $ABC$ with $D$ is the foot of the altitude from $A.$ The perpendicular lines to $BC$ through $B$ and $C$ intersect the altitudes from $C$ and $B$ at points $M$ and $N$, respectively. Show that $AD$ $=$ $BC$ if and only if $A,M,N$ and $D$ lie on the same circle.

Let $ \{k_n\}_{n \equal{} 1}^{\infty}$ be a sequence of real numbers having the properties $ k_1 > 1$ and $ k_1 \plus{} k_2 \plus{} \cdots \plus{} k_n < 2k_n$ for $ n \equal{} 1,2,...$. Prove that there exists a number $ q > 1$ such that $ k_n > q^n$ for every positive integer $ n$.

Let $ABCD$ be a cyclic quadrilateral such that $AC =56, BD = 65, BC>DA$ and $AB: BC =CD: DA$. Find the ratio of areas $S (ABC): S (ADC)$.

Suppose that $n$ has (at least) two essentially distinct representations as a sum of two squares. Specifically, let $n=s^{2}+t^{2}=u^{2}+v^{2}$, where $s \ge t \ge 0$, $u \ge v \ge 0$, and $s>u$. Show that $\gcd(su-tv, n)$ is a proper divisor of $n$.

How many integers between $123$ and $789$ have at least two identical digits, when written in base $10?$ $$ \mathrm a. ~ 180\qquad \mathrm b.~184\qquad \mathrm c. ~186 \qquad \mathrm d. ~189 \qquad \mathrm e. ~191 $$

The Evil League of Evil is plotting to poison the city's water supply. They plan to set out from their headquarters at $(5, 1)$ and put poison in two pipes, one along the line $y=x$ and one along the line $x=7$. However, they need to get the job done quickly before Captain Hammer catches them. What's the shortest distance they can travel to visit both pipes and then return to their headquarters?

Circles $ \omega_{1}$ and $ \omega_{2}$ intersect at points $ A$ and $ B.$ Points $ C$ and $ D$ are on circles $ \omega_{1}$ and $ \omega_{2},$ respectively, such that lines $ AC$ and $ AD$ are tangent to circles $ \omega_{2}$ and $ \omega_{1},$ respectively. Let $ I_{1}$ and $ I_{2}$ be the incenters of triangles $ ABC$ and $ ABD,$ respectively. Segments $ I_{1}I_{2}$ and $ AB$ intersect at $ E$. Prove that: $ \frac {1}{AE} \equal{} \frac {1}{AC} \plus{} \frac {1}{AD}$

Determine the smallest positive real $K$ such that the inequality \[ K + \frac{a + b + c}{3} \ge (K + 1) \sqrt{\frac{a^2 + b^2 + c^2}{3}} \]holds for any real numbers $0 \le a,b,c \le 1$. [i]Proposed by Fajar Yuliawan, Indonesia[/i]

\[\int_0^2 e^x(x^4+8x^3+18x^2+16x+5)\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

[u]Part 1 [/u] [b]p1.[/b] Calculate $$(4!-5!+2^5 +2^6) \cdot \frac{12!}{7!}+(1-3)(4!-2^4).$$ [b]p2.[/b] The expression $\sqrt{9!+10!+11!}$ can be expressed as $a\sqrt{b}$ for positive integers $a$ and $b$, where $b$ is squarefree. Find $a$. [b]p3.[/b] For real numbers $a$ and $b$, $f(x) = ax^{10}-bx^4+6x +10$ for all real $x$. Given that $f(42) = 11$, find $f (-42)$. [u]Part 2[/u] [b]p4.[/b] How many positive integers less than or equal to $2023$ are divisible by $20$, $23$, or both? [b]p5.[/b] Larry the ant crawls along the surface of a cylinder with height $48$ and base radius $\frac{14}{\pi}$ . He starts at point $A$ and crawls to point $B$, traveling the shortest distance possible. What is the maximum this distance could be? [b]p6.[/b] For a given positive integer $n$, Ben knows that $\lfloor 20x \rfloor = n$, where $x$ is real. With that information, Ben determines that there are $3$ distinct possible values for $\lfloor 23x \rfloor$. Find the least possible value of $n$. [u]Part 3 [/u] [b]p7.[/b] Let $ABC$ be a triangle with area $1$. Points $D$, $E$, and $F$ lie in the interior of $\vartriangle ABC$ in such a way that $D$ is the midpoint of $AE$, $E$ is the midpoint of $BF$, and $F$ is the midpoint of $CD$. Compute the area of $DEF$. [b]p8.[/b] Edwin and Amelia decide to settle an argument by running a race against each other. The starting line is at a given vertex of a regular octahedron and the finish line is at the opposite vertex. Edwin has the ability to run straight through the octahedron, while Amelia must stay on the surface of the octahedron. Given that they tie, what is the ratio of Edwin’s speed to Amelia’s speed? [b]p9.[/b] Jxu is rolling a fair three-sided die with faces labeled $0$, $1$, and $2$. He keeps going until he rolls a $1$, immediately followed by a $2$. What is the expected number of rolls Jxu makes? [u]Part 4 [/u] [b]p10.[/b] For real numbers $x$ and $y$, $x +x y = 10$ and $y +x y = 6$. Find the sum of all possible values of $\frac{x}{y}$. [b]p11.[/b] Derek is thinking of an odd two-digit integer $n$. He tells Aidan that $n$ is a perfect power and the product of the digits of $n$ is also a perfect power. Find the sum of all possible values of $n$. [b]p12.[/b] Let a three-digit positive integer $N = \overline{abc}$ (in base $10$) be stretchable with respect to $m$ if $N$ is divisible by $m$, and when $N$‘s middle digit is duplicated an arbitrary number of times, it‘s still divisible by $m$. How many three-digit positive integers are stretchable with respect to $11$? (For example, $432$ is stretchable with respect to $6$ because $433...32$ is divisible by $6$ for any positive integer number of $3$s.) [u]Part 5 [/u] [b]p13.[/b] How many trailing zeroes are in the base-$2023$ expansion of $2023!$ ? [b]p14.[/b] The three-digit positive integer $k = \overline{abc}$ (in base $10$, with a nonzero) satisfies $\overline{abc} = c^{2ab-1}$. Find the sum of all possible $k$. [b]p15.[/b] For any positive integer $k$, let $a_k$ be defined as the greatest nonnegative real number such that in an infinite grid of unit squares, no circle with radius less than or equal to $a_k$ can partially cover at least $k$ distinct unit squares. (A circle partially covers a unit square only if their intersection has positive area.) Find the sumof all positive integers $n \le 12$ such that $a_n \ne a_{n+1}$. PS. You should use hide for answers. Rounds 6-9 have been posted [url=https://artofproblemsolving.com/community/c3h3267915p30057005]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let f be a function defined in the set $\{0, 1, 2,...\}$ of non-negative integers, satisfying $f(2x) = 2f(x), f(4x+1) = 4f(x) + 3$, and $f(4x-1) = 2f(2x - 1) -1$. Show that $f $ is an injection, i.e. if $f(x) = f(y)$, then $x = y$.

Find all triples of integers \( (x, y, z) \) such that \[ x - yz = 11 \] \[ xz + y = 13 \]

[b]p1.[/b] It takes $12$ months for Santa Claus to pack gifts. It would take $20$ months for his apprentice to do the job. If they work together, how long will it take for them to pack the gifts? [b]p2.[/b] All passengers on a bus sit in pairs. Exactly $2/5$ of all men sit with women, exactly $2/3$ of all women sit with men. What part of passengers are men? [b]p3.[/b] There are $100$ colored balls in a box. Every $10$-tuple of balls contains at least two balls of the same color. Show that there are at least $12$ balls of the same color in the box. [b]p4.[/b] There are $81$ wheels in storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that one can determine which wheel is incorrectly marked with four measurements. [b]p5.[/b] Remove from the figure below the specified number of matches so that there are exactly $5$ squares of equal size left: (a) $8$ matches (b) $4$ matches [img]https://cdn.artofproblemsolving.com/attachments/4/b/0c5a65f2d9b72fbea50df12e328c024a0c7884.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We consider the $n$ vertices of a regular polygon with $n$ sides. There is a set of triangles with vertices at these $n$ points with the property that for each triangle in the set, the sides of at least one are not the side of any other triangle in the set. What is the largest amount of triangles that can have the set? [hide=original wording]Consideramos los n vértices de un polígono regular de n lados. Se tiene un conjunto de triángulos con vértices en estos n puntos con la propiedad que para cada triángulo del conjunto, al menos uno de sus lados no es lado de ningún otro triángulo del conjunto. ¿Cuál es la mayor cantidad de triángulos que puede tener el conjunto?[/hide]

Determine all polynomials $P(x)$ with real coefficients and which satisfy the following properties: i) $P(0) = 1$ ii) for any real numbers $x$ and $y,$ \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\]