A baseball league has $64$ people, each with a different $6$-digit binary number whose base-$10$ value ranges from $0$ to $63$. When any player bats, they do the following: for each pitch, they swing if their corresponding bit number is a $1$, otherwise, they decide to wait and let the ball pass. For example, the player with the number $11$ has binary number $001011$. For the first and second pitch, they wait; for the third, they swing, and so on. Pitchers follow a similar rule to decide whether to throw a splitter or a fastball, if the bit is $0$, they will throw a splitter, and if the bit is $1$, they will throw a fastball. If a batter swings at a fastball, then they will score a hit; if they swing on a splitter, they will miss and get a “strike.” If a batter waits on a fastball, then they will also get a strike. If a batter waits on a splitter, then they get a “ball.” If a batter gets $3$ strikes, then they are out; if a batter gets $4$ balls, then they automatically get a hit. For example, if player $11$ pitched against player $6$ (binary is $000110$), the batter would get a ball for the first pitch, a ball for the second pitch, a strike for the third pitch, a strike for the fourth pitch, and a hit for the fifth pitch; as a result, they will count that as a “hit.” If player $11$ pitched against player $5$ (binary is $000101$), however, then the fifth pitch would be the batter’s third strike, so the batter would be “out.” Each player in the league plays against every other player exactly twice; once as batter, and once as pitcher. They are then given a score equal to the number of outs they throw as a pitcher plus the number of hits they get as a batter. What is the highest score received?

Let $g : \mathbb{N} \to \mathbb{N}$ be a function satisfying: [list] [*] $g(xy) = g(x)g(y)$ for all $x, y \in \mathbb{N}$, [*] $g(g(x)) = x$ for all $x \in \mathbb{N}$, and [*] $g(x) \neq x$ for $2 \leq x \leq 2018$. [/list] Find the minimum possible value of $g(2)$.

Let $a,b,c,d,e,f$ be positive numbers such that $a,b,c,d$ is an arithmetic progression, and $a,e,f,d$ is a geometric progression. Prove that $bc\ge ef$.

A triangle $ABC$ is given. The point $K$ is the base of the external bisector of angle $A$. The point $M$ is the midpoint of the arc $AC$ of the circumcircle. The point $N$ on the bisector of angle $C$ is such that $AN \parallel BM$. Prove that the points $M,N,K$ are collinear. [i](Proposed by Ilya Bogdanov)[/i]

Malmer Pebane, Fames Jung, and Weven Dare are perfect logicians that always tell the truth. Malmer decides to pose a puzzle to his friends: he tells them that the day of his birthday is at most the number of the month of his birthday. Then Malmer announces that he will whisper the day of his birthday to Fames and the month of his birthday to Weven, and he does exactly that. After Malmer whispers to both of them, Fames thinks a bit, then says “Weven cannot know what Malmer’s birthday is.” After that, Weven thinks a bit, then says “Fames also cannot know what Malmer’s birthday is.” This exchange repeats, with Fames and Weven speaking alternately and each saying the other can’t know Malmer’s birthday. However, at one point, Weven instead announces “Fames and I can now know what Malmer’s birthday is. Interestingly, that was the longest conversation like that we could have possibly had before both figuring out Malmer’s birthday.” Find Malmer’s birthday.

Let $f(x)=x^2+x$ for all real $x$. There exist positive integers $m$ and $n$, and distinct nonzero real numbers $y$ and $z$, such that $f(y)=f(z)=m+\sqrt{n}$ and $f(\frac{1}{y})+f(\frac{1}{z})=\frac{1}{10}$. Compute $100m+n$. [i]Proposed by Luke Robitaille[/i]

Let $a, b, c \in R,$ $a \ne 0$, such that $a$ and $4a+3b+2c$ have the same sign. Show that the equation $ax^2+bx+c=0$ cannot have both roots in the interval $(1,2)$.

The shortest distance from an integral point to line $y=\frac{5}{3}x+\frac{4}{5}$ is $\text{(A)}\frac{\sqrt{34}}{170}\qquad\text{(B)}\frac{\sqrt{34}}{85}\qquad\text{(C)}\frac{1}{20}\qquad\text{(D)}\frac{1}{30}$

[b]p1.[/b] Evaluate $6^4 +5^4 +3^4 +2^4$. [b]p2.[/b] What digit is most frequent between $1$ and $1000$ inclusive? [b]p3.[/b] Let $n = gcd \, (2^2 \cdot 3^3 \cdot 4^4,2^4 \cdot 3^3 \cdot 4^2)$. Find the number of positive integer factors of $n$. [b]p4.[/b] Suppose $p$ and $q$ are prime numbers such that $13p +5q = 91$. Find $p +q$. [b]p5.[/b] Let $x = (5^3 -5)(4^3 -4)(3^3 -3)(2^3 -2)(1^3 -1)$. Evaluate $2018^x$ . [b]p6.[/b] Liszt the lister lists all $24$ four-digit integers that contain each of the digits $1,2,3,4$ exactly once in increasing order. What is the sum of the $20$th and $18$th numbers on Liszt’s list? [b]p7.[/b] Square $ABCD$ has center $O$. Suppose $M$ is the midpoint of $AB$ and $OM +1 =OA$. Find the area of square $ABCD$. [b]p8.[/b] How many positive $4$-digit integers have at most $3$ distinct digits? [b]p9.[/b] Find the sumof all distinct integers obtained by placing $+$ and $-$ signs in the following spaces $$2\_3\_4\_5$$ [b]p10.[/b] In triangle $ABC$, $\angle A = 2\angle B$. Let $I$ be the intersection of the angle bisectors of $B$ and $C$. Given that $AB = 12$, $BC = 14$,and $C A = 9$, find $AI$ . [b]p11.[/b] You have a $3\times 3\times 3$ cube in front of you. You are given a knife to cut the cube and you are allowed to move the pieces after each cut before cutting it again. What is the minimumnumber of cuts you need tomake in order to cut the cube into $27$ $1\times 1\times 1$ cubes? p12. How many ways can you choose $3$ distinct numbers fromthe set $\{1,2,3,...,20\}$ to create a geometric sequence? [b]p13.[/b] Find the sum of all multiples of $12$ that are less than $10^4$ and contain only $0$ and $4$ as digits. [b]p14.[/b] What is the smallest positive integer that has a different number of digits in each base from $2$ to $5$? [b]p15.[/b] Given $3$ real numbers $(a,b,c)$ such that $$\frac{a}{b +c}=\frac{b}{3a+3c}=\frac{c}{a+3b},$$ find all possible values of $\frac{a +b}{c}$. [b]p16.[/b] Let S be the set of lattice points $(x, y, z)$ in $R^3$ satisfying $0 \le x, y, z \le 2$. How many distinct triangles exist with all three vertices in $S$? [b]p17.[/b] Let $\oplus$ be an operator such that for any $2$ real numbers $a$ and $b$, $a \oplus b = 20ab -4a -4b +1$. Evaluate $$\frac{1}{10} \oplus \frac19 \oplus \frac18 \oplus \frac17 \oplus \frac16 \oplus \frac15 \oplus \frac14 \oplus \frac13 \oplus \frac12 \oplus 1.$$ [b]p18.[/b] A function $f :N \to N$ satisfies $f ( f (x)) = x$ and $f (2f (2x +16)) = f \left(\frac{1}{x+8} \right)$ for all positive integers $x$. Find $f (2018)$. [b]p19.[/b] There exists an integer divisor $d$ of $240100490001$ such that $490000 < d < 491000$. Find $d$. [b]p20.[/b] Let $a$ and $b$ be not necessarily distinct positive integers chosen independently and uniformly at random from the set $\{1,2, 3, ... ,511,512\}$. Let $x = \frac{a}{b}$ . Find the probability that $(-1)^x$ is a real number. [b]p21[/b]. In $\vartriangle ABC$ we have $AB = 4$, $BC = 6$, and $\angle ABC = 135^o$. $\angle ABC$ is trisected by rays $B_1$ and $B_2$. Ray $B_1$ intersects side $C A$ at point $F$, and ray $B_2$ intersects side $C A$ at point $G$. What is the area of $\vartriangle BFG$? [b]p22.[/b] A level number is a number which can be expressed as $x \cdot \lfloor x \rfloor \cdot \lceil x \rceil$ where $x$ is a real number. Find the number of positive integers less than or equal to $1000$ which are also level numbers. [b]p23.[/b] Triangle $\vartriangle ABC$ has sidelengths $AB = 13$, $BC = 14$, $C A = 15$ and circumcenter $O$. Let $D$ be the intersection of $AO$ and $BC$. Compute $BD/DC$. [b]p24.[/b] Let $f (x) = x^4 -3x^3 +2x^2 +5x -4$ be a quartic polynomial with roots $a,b,c,d$. Compute $$\left(a+1 +\frac{1}{a} \right)\left(b+1 +\frac{1}{b} \right)\left(c+1 +\frac{1}{c} \right)\left(d+1 +\frac{1}{d} \right).$$ [b]p25.[/b] Triangle $\vartriangle ABC$ has centroid $G$ and circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 2018$, $BD =20$, and $CD = 18$, find the area of triangle $\vartriangle DOG$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given an acute triangle ${ABC}$, erect triangles ${ABD}$ and ${ACE}$ externally, so that ${\angle ADB= \angle AEC=90^o}$ and ${\angle BAD= \angle CAE}$. Let ${{A}_{1}}\in BC,{{B}_{1}}\in AC$ and ${{C}_{1}}\in AB$ be the feet of the altitudes of the triangle ${ABC}$, and let $K$ and ${K,L}$ be the midpoints of $[ B{{C}_{1}} ]$ and ${BC_1, CB_1}$, respectively. Prove that the circumcenters of the triangles $AKL,{{A}_{1}}{{B}_{1}}{{C}_{1}}$ and ${DEA_1}$ are collinear. (Bulgaria)

Suppose that a sequence $\{a_n\}_{n\ge 1}$ satisfies $0 < a_n \le a_{2n} + a_{2n+1}$ for all $n\in \mathbb{N}$. Prove that the series$\sum_{n=1}^{\infty} a_n$ diverges.

Determine the number of polynomials of degree $ 3 $ that are irreducible over the field of integers modulo a prime.

Let $S$ be the set of points $(x,y)$ in the coordinate plane such that two of the three quantities $3$, $x+2$, and $y-4$ are equal and the third of the three quantities is no greater than this common value. Which of the following is a correct description of $S$? $\textbf{(A) } \text{a single point} \qquad \textbf{(B) } \text{two intersecting lines} \\ \\ \textbf{(C) } \text{three lines whose pairwise intersections are three distinct points} \\ \\ \textbf{(D) } \text{a triangle} \qquad \textbf{(E) } \text{three rays with a common endpoint}$

A point $D$ is chosen in the interior of the side $BC$ of an acute triangle $ABC$, and another point $P$ in the interior of the segment $AD$, but not lying on the median through $C$. This median (through $C$) intersects the circumcircle of a triangle $CPD$ at $K(\ne C)$. Prove that the circumcircle of triangle $AKP$ always passes through a fixed point $M(\ne A)$ independent of the choices of the points $D$ and $P.$

Let $O,A,B,C$ be variable points in the plane such that $OA=4$, $OB=2\sqrt3$ and $OC=\sqrt {22}$. Find the maximum value of the area $ABC$. [i]Mihai Baluna[/i]

The positive integers $ A$, $ B$, $ A \minus{} B$, and $ A \plus{} B$ are all prime numbers. The sum of these four primes is $ \textbf{(A)}\ \text{even} \qquad \textbf{(B)}\ \text{divisible by }3 \qquad \textbf{(C)}\ \text{divisible by }5 \qquad \textbf{(D)}\ \text{divisible by }7 \\ \textbf{(E)}\ \text{prime}$

An arrangement of chips in the squares of $ n\times n$ table is called [i]sparse[/i] if every $ 2\times 2$ square contains at most 3 chips. Serge put chips in some squares of the table (one in a square) and obtained a sparse arrangement. He noted however that if any chip is moved to any free square then the arrangement is no more sparce. For what $ n$ is this possible? [i]Proposed by S. Berlov[/i]

Let $R$ ba a finite ring with the following property: for any $a,b\in R$ there exists an element $c\in R$ (depending on $a$ and $b$) such that $a^2+b^2=c^2$. Prove that for any $a,b,c\in R$ there exists $d\in R$ such that $2abc=d^2$. (Here $2abc$ denotes $abc+abc$. The ring $R$ is assumed to be associative, but not necessarily commutative and not necessarily containing a unit.

Let $m$ and $n$ be positive integers such that $m>n$ and $m \equiv n \pmod{2}$. If $(m^2-n^2+1) \mid n^2-1$, then prove that $m^2-n^2+1$ is a perfect square. (proposed by G. Batzaya, folklore)

A real function has been assigned to every cell of an $n \times n$ table. Prove that a function can be assigned to each row and each column of this table such that the function assigned to each cell is equivalent to the combination of functions assigned to the row and the column containing it.

Consider 2009 cards which are lying in sequence on a table. Initially, all cards have their top face white and bottom face black. The cards are enumerated from 1 to 2009. Two players, Amir and Ercole, make alternating moves, with Amir starting. Each move consists of a player choosing a card with the number $k$ such that $k < 1969$ whose top face is white, and then this player turns all cards at positions $k,k+1,\ldots,k+40.$ 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]Also compare shortlist 2009, combinatorics problem C1.[/i]

Find all polynomials $P(x)$ with real coefficients such that the polynomial $$Q(x) = (x + 1)P(x-1) -(x-1)P(x)$$ is constant.

While running from an unrealistically rendered zombie, Willy Smithers runs into a vacant lot in the shape of a square, $100$ meters on a side. Call the four corners of the lot corners $1$, $2$, $3$, and $4$, in clockwise order. For $k = 1, 2, 3, 4$, let $d_k$ be the distance between Willy and corner $k$. Let (a) $d_1<d_2<d_4<d_3$, (b) $d_2$ is the arithmetic mean of $d_1$ and $d_3$, and (c) $d_4$ is the geometric mean of $d_2$ and $d_3$. If $d_1^2$ can be written in the form $\dfrac{a-b\sqrt c}d$, where $a,b,c,$ and $d$ are positive integers, $c$ is square-free, and the greatest common divisor of $a$, $b$, and $d$ is $1,$ find the remainder when $a+b+c+d$ is divided by $2008$.

We define a sequence $a_n$ so that $a_0=1$ and \[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \] for all postive integers $n$. Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.

Prove that for any polynomial $P$ with integer coefficients and any natural number $k$ there exists a natural number $n$ such that $P(1) + P(2) + ...+ P(n)$ is divisible by $k$.