A softball team played ten games, scoring $1,2,3,4,5,6,7,8,9$, and $10$ runs. They lost by one run in exactly five games. In each of the other games, they scored twice as many runs as their opponent. How many total runs did their opponents score? $ \textbf {(A) } 35 \qquad \textbf {(B) } 40 \qquad \textbf {(C) } 45 \qquad \textbf {(D) } 50 \qquad \textbf {(E) } 55 $

Let $x>1$ be a real number which is not an integer. For each $n\in\mathbb{N}$, let $a_n=\lfloor x^{n+1}\rfloor - x\lfloor x^n\rfloor$. Prove that the sequence $(a_n)$ is not periodic.

Let $A$ be a $3$-digit positive integer and $B$ be the positive integer that comes from $A$ be replacing with each other the digits of hundreds with the digit of the units. It is also given that $B$ is a $3$-digit number. Find numbers $A$ and $B$ if it is known that $A$ divided by $B$ gives quotient $3$ and remainder equal to seven times the sum of it's digits.

We have $4$ circles in plane such that any two of them are tangent to each other. we connect the tangency point of two circles to the tangency point of two other circles. Prove that these three lines are concurrent. [i]proposed by Masoud Nourbakhsh[/i]

[b]p1.[/b] The number $2020$ is very special: the sum of its digits is equal to the product of its nonzero digits. How many such four digit numbers are there? (Numbers with only one nonzero digit, like $3000$, also count) [b]p2.[/b] A locker has a combination which is a sequence of three integers between $ 0$ and $49$, inclusive. It is known that all of the numbers in the combination are even. Let the total of a lock combination be the sum of the three numbers. Given that the product of the numbers in the combination is $12160$, what is the sum of all possible totals of the locker combination? [b]p3.[/b] Given points $A = (0, 0)$ and $B = (0, 1)$ in the plane, the set of all points P in the plane such that triangle $ABP$ is isosceles partitions the plane into $k$ regions. The sum of the areas of those regions that are bounded is $s$. Find $ks$. [b]p4.[/b] Three families sit down around a circular table, each person choosing their seat at random. One family has two members, while the other two families have three members. What is the probability that every person sits next to at least one person from a different family? [b]p5.[/b] Jacob and Alexander are walking up an escalator in the airport. Jacob walks twice as fast as Alexander, who takes $18$ steps to arrive at the top. Jacob, however, takes $27$ steps to arrive at the top. How many of the upward moving escalator steps are visible at any point in time? [b]p6.[/b] Points $A, B, C, D, E$ lie in that order on a circle such that $AB = BC = 5$, $CD = DE = 8$, and $\angle BCD = 150^o$ . Let $AD$ and $BE$ intersect at $P$. Find the area of quadrilateral $PBCD$. [b]p7.[/b] Ivan has a triangle of integers with one number in the first row, two numbers in the second row, and continues up to eight numbers in the eighth row. He starts with the first $8$ primes, $2$ through $19$, in the bottom row. Each subsequent row is filled in by writing the least common multiple of two adjacent numbers in the row directly below. For example, the second last row starts with$ 6, 15, 35$, etc. Let P be the product of all the numbers in this triangle. Suppose that P is a multiple of $a/b$, where $a$ and $b$ are positive integers and $a > 1$. Given that $b$ is maximized, and for this value of $b, a$ is also maximized, find $a + b$. [b]p8.[/b] Let $ABCD$ be a cyclic quadrilateral. Given that triangle $ABD$ is equilateral, $\angle CBD = 15^o$, and $AC = 1$, what is the area of $ABCD$? [b]p9.[/b] Let $S$ be the set of all integers greater than $ 1$. The function f is defined on $S$ and each value of $f$ is in $S$. Given that $f$ is nondecreasing and $f(f(x)) = 2x$ for all $x$ in $S$, find $f(100)$. [b]p10.[/b] An [i]origin-symmetric[/i] parallelogram $P$ (that is, if $(x, y)$ is in $P$, then so is $(-x, -y)$) lies in the coordinate plane. It is given that P has two horizontal sides, with a distance of $2020$ between them, and that there is no point with integer coordinates except the origin inside $P$. Also, $P$ has the maximum possible area satisfying the above conditions. The coordinates of the four vertices of P are $(a, 1010)$, $(b, 1010)$, $(-a, -1010)$, $(-b, -1010)$, where a, b are positive real numbers with $a < b$. What is $b$? [b]p11.[/b] What is the remainder when $5^{200} + 5^{50} + 2$ is divided by $(5 + 1)(5^2 + 1)(5^4 + 1)$? [b]p12.[/b] Let $f(n) = n^2 - 4096n - 2045$. What is the remainder when $f(f(f(... f(2046)...)))$ is divided by $2047$, where the function $f$ is applied $47$ times? [b]p13.[/b] What is the largest possible area of a triangle that lies completely within a $97$-dimensional hypercube of side length $1$, where its vertices are three of the vertices of the hypercube? [b]p14.[/b] Let $N = \left \lfloor \frac{1}{61} \right \rfloor + \left \lfloor\frac{3}{61} \right \rfloor+\left \lfloor \frac{3^2}{61} \right \rfloor+... +\left \lfloor\frac{3^{2019}}{61} \right \rfloor$. Given that $122N$ can be expressed as $3^a - b$, where $a, b$ are positive integers and $a$ is as large as possible, find $a + b$. Note: $\lfloor x \rfloor$ is defined as the greatest integer less than or equal to $x$. [b]p15.[/b] Among all ordered triples of integers $(x, y, z)$ that satisfy $x + y + z = 8$ and $x^3 + y^3 + z^3 = 134$, what is the maximum possible value of $|x| + |y| + |z|$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For a positive integer $n$, let $f\left(n\right)$ be the sum of the first $n$ terms of the sequence $$0,1,1,2,2,3,3,4,4,\ldots,r,r,r+1,r+1,\ldots.$$ For example, $f\left(5\right)=0+1+1+2+2=6$. (a) Find a formula for $f\left(n\right)$. (b) Prove that $f\left(s+t\right)-f\left(s-t\right)=st$ for all positive integers $s$ and $t$, where $s>t$.

Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? [i]Proposed by Michael Albert, Richard Guy, New Zealand[/i]

An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ [i]Shiny[/i] if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have $$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$ Find the largest constant $K = K(n)$ such that $$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$ holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.

How many integers are there in $\{0,1, 2,..., 2014\}$ such that $C^x_{2014} \ge C^{999}{2014}$ ? (A): $15$, (B): $16$, (C): $17$, (D): $18$, (E) None of the above. Note: $C^{m}_{n}$ stands for $\binom {m}{n}$

Let $M$ be a positive integer. At a party with 120 people, 30 wear red hats, 40 wear blue hats, and 50 wear green hats. Before the party begins, $M$ pairs of people are friends. (Friendship is mutual.) Suppose also that no two friends wear the same colored hat to the party. During the party, $X$ and $Y$ can become friends if and only if the following two conditions hold: [list] [*] There exists a person $Z$ such that $X$ and $Y$ are both friends with $Z$. (The friendship(s) between $Z,X$ and $Z,Y$ could have been formed during the party.) [*] $X$ and $Y$ are not wearing the same colored hat. [/list] Suppose the party lasts long enough so that all possible friendships are formed. Let $M_1$ be the largest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, there will always be at least one pair of people $X$ and $Y$ with different colored hats who are not friends after the party. Let $M_2$ be the smallest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, every pair of people $X$ and $Y$ with different colored hats are friends after the party. Find $M_1+M_2$. [hide="Clarifications"] [list] [*] The definition of $M_2$ should read, ``Let $M_2$ be the [i]smallest[/i] value of $M$ such that...''. An earlier version of the test read ``largest value of $M$''.[/list][/hide] [i]Victor Wang[/i]

Let $ABC$ be a triangle without obtuse angles, $M$ the midpoint of $BC$, $K$ the midpoint of $BM$. What is the largest value of the angle $\angle KAM$?

Let $\triangle{ABC}$ be a triangle with $AB = 10$ and $AC = 11$. Let $I$ be the center of the inscribed circle of $\triangle{ABC}$. If $M$ is the midpoint of $AI$ such that $BM = BC$ and $CM = 7$, then $BC$ can be expressed in the form $\frac{\sqrt{a}-b}{c}$ where $a$, $b$, and $c$ are positive integers. Find $a+b+c$. [color=#00f]Note that this problem is null because a diagram is impossible.[/color] [i]Proposed by Andy Xu[/i]

From a list of integers from $1$ to $2022$, inclusive, delete all numbers in which at least one of its digits is a prime How many numbers remain without erasing?

Let $S=\{1928,1929,1930,\cdots,1949\}.$ We call one of $S$’s subset $M$ is a [i]red[/i] subset, if the sum of any two different elements of $M$ isn’t divided by $4.$ Let $x,y$ be the number of the [i]red[/i] subsets of $S$ with $4$ and $5$ elements,respectively. Determine which of $x,y$ is greater and prove that.

Two people $A$ and $B$ play the following game: They take from $\{0, 1, 2, 3,..., 1024\}$ alternately $512$, $256$, $128$, $64$, $32$, $16$, $8$, $4$, $2$, $1$, numbers away where $A$ first removes $512$ numbers, $B$ removes $256$ numbers etc. Two numbers $a, b$ remain ($a < b$). $B$ pays $A$ the amount $b - a$. $A$ would like to win as much as possible, $B$ would like to lose as little as possible. What profit does $A$ make if does every player play optimally according to their goals? The result must be justified.

Characterize all increasing sequences $(s_n)$ of positive reals for which there exists a set $A\subset \mathbb{R}$ with positive measure such that $\lambda(A\cap I)<\frac{s_n}{n}$ holds for every interval $I$ with length $1/n$, where $\lambda$ denotes the Lebesgue measure.

Find the number of integers $1\leq k\leq1336$ such that $\binom{1337}{k}$ divides $\binom{1337}{k-1}\binom{1337}{k+1}$. [i]Proposed by Tristan Shin[/i]

Let $P(x)$ be a real quadratic trinomial, so that for all $x\in \mathbb{R}$ the inequality $P(x^3+x)\geq P(x^2+1)$ holds. Find the sum of the roots of $P(x)$. [i]Proposed by A. Golovanov, M. Ivanov, K. Kokhas[/i]

Let $\zeta= e^{2\pi i/99}$ and $\omega e^{2\pi i/101}$. The polynomial $$x^{9999} + a_{9998}x^{9998} + ...+ a_1x + a_0$$ has roots $\zeta^m + \omega^n$ for all pairs of integers $(m, n)$ with $0 \le m < 99$ and $0 \le n < 101$. Compute $a_{9799} + a_{9800} + ...+ a_{9998}$.

Let $\vartriangle ABC$ be an equilateral triangle. Points $D,E, F$ are drawn on sides $AB$,$BC$, and $CA$ respectively such that $[ADF] = [BED] + [CEF]$ and $\vartriangle ADF \sim \vartriangle BED \sim \vartriangle CEF$. The ratio $\frac{[ABC]}{[DEF]}$ can be expressed as $\frac{a+b\sqrt{c}}{d}$ , where $a$, $b$, $c$, and $d$ are positive integers such that $a$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. (Here $[P]$ denotes the area of polygon $P$.)

Given that the answer to this problem can be expressed as $a\cdot b\cdot c$, where $a$, $b$, and $c$ are pairwise relatively prime positive integers with $b=10$, compute $1000a+100b+10c$. [i]Proposed by Ankit Bisain[/i]

Consider the isosceles triangle $ABC$ inscribed in the semicircle of radius $ r$. If the $\vartriangle BCD$ and $\vartriangle CAE$ are equilateral, determine the altitude of $\vartriangle DEC$ on the side $DE$ in terms of $ r$. [img]https://cdn.artofproblemsolving.com/attachments/6/3/772ff9a1fd91e9fa7a7e45ef788eec7a1ba48e.png[/img]

Let us consider a polynomial $P(x)$ with integers coefficients satisfying $$P(-1)=-4,\ P(-3)=-40,\text{ and } P(-5)=-156.$$ What is the largest possible number of integers $x$ satisfying $$P(P(x))=x^2?$$

Two straight lines $a$ and $b$ are given and also points $A$ and $B$. Point $X$ slides along the line $a$, and point $Y$ slides along the line $b$, so that $AX \parallel BY$. Find the locus of the intersection point of $AY$ with $XB$.

Let $n \geq 0$ be an integer and $f: [0, 1] \rightarrow \mathbb{R}$ an integrable function such that: $$\int^1_0f(x)dx = \int^1_0xf(x)dx = \int^1_0x^2f(x)dx = \ldots = \int^1_0x^nf(x)dx = 1$$ Prove that: $$\int_0^1f(x)^2dx \geq (n+1)^2$$