In how many ways every unit square of a $2018$ x $2018$ board can be colored in red or white such that number of red unit squares in any two rows are distinct and number of red squares in any two columns are distinct.

$(HUN 1)$ Let $a$ and $b$ be arbitrary integers. Prove that if $k$ is an integer not divisible by $3$, then $(a + b)^{2k}+ a^{2k} +b^{2k}$ is divisible by $a^2 +ab+ b^2$

Does there exist a triangle, whose side is equal to some of its altitudes, another side is equal to some of its bisectors, and the third is equal to some of its medians?

[b]p1.[/b] The total cost of $1$ football, $3$ tennis balls and $7$ golf balls is $\$14$ , while that of $1$ football, $4$ tennis balls and $10$ golf balls is $\$17$.If one has $\$20$ to spend, is this sufficient to buy a) $3$ footballs and $2$ tennis balls? b) $2$ footballs and $3$ tennis balls? [b]p2.[/b] Let $\overline{AB}$ and $\overline{CD}$ be two chords in a circle intersecting at a point $P$ (inside the circle). a) Prove that $AP \cdot PB = CP\cdot PD$. b) If $\overline{AB}$ is perpendicular to $\overline{CD}$ and the length of $\overline{AP}$ is $2$, the length of $\overline{PB}$ is $6$, and the length of $\overline{PD}$ is $3$, find the radius of the circle. [b]p3.[/b] A polynomial $P(x)$ of degree greater than one has the remainder $2$ when divided by $x-2$ and the remainder $3$ when divided by $x-3$. Find the remainder when $P(x)$ is divided by $x^2-5x+6$. [b]p4.[/b] Let $x_1= 2$ and $x_{n+1}=x_n+ (3n+2)$ for all $n$ greater than or equal to one. a) Find a formula expressing $x_n$ as a function of$ n$. b) Prove your result. [b]p5.[/b] The point $M$ is the midpoint of side $\overline{BC}$ of a triangle $ABC$. a) Prove that $AM \le \frac12 AB + \frac12 AC$. b) A fly takes off from a certain point and flies a total distance of $4$ meters, returning to the starting point. Explain why the fly never gets outside of some sphere with a radius of one meter. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many $8$-digit numbers in base $4$ formed of the digits $1,2, 3$ are divisible by $3$?

Paul fills in a $7\times7$ grid with the numbers $1$ through $49$ in a random arrangement. He then erases his work and does the same thing again, to obtain two different random arrangements of the numbers in the grid. What is the expected number of pairs of numbers that occur in either the same row as each other or the same column as each other in both of the two arrangements?

Positive integers $x$ and $y$ satisfy the equation $\sqrt{x}+\sqrt{y}=\sqrt{1183}.$ What is the minimum possible value of $x+y?$ $\textbf{(A) }585 \qquad\textbf{(B) }595\qquad\textbf{(C) }623\qquad\textbf{(D) }700\qquad\textbf{(E) }791$

A point moves on the sides of the triangle $ABC$, defined by the vertices $A(-1.8, 0)$, $B(3.2, 0)$, $C(0, 2.4)$ . Determine the positions of said point, in which the sum of their distance to the three vertices is absolute maximum or minimum. [img]https://cdn.artofproblemsolving.com/attachments/2/5/9e5bb48cbeefaa5f4c069532bf5605b9c1f5ea.png[/img]

Compute the number of three digit numbers such that all three digits are distinct and in descending order, and one of the digits is a $5$.

In the $25$ squares of a $5 \times 5$ square, zeros are initially written. in the every minute Ionel chooses two squares with a common side. If they are written in them the numbers $a$ and $b$, then he writes instead the numbers $a + 1$ and $b + 1$ or $a - 1$ and $b - 1$. Over time he noticed that the sums of the numbers in each line were equal, as well as the sums of the numbers in each column are equal. Prove that this observation was made after an even number of minutes.

Let \(d(n)\) denote the number of positive divisors of \(n\). The sequence \(a_0\), \(a_1\), \(a_2\), \(\ldots\) is defined as follows: \(a_0=1\), and for all integers \(n\ge1\), \[a_n=d(a_{n-1})+d(d(a_{n-2}))+\cdots+ {\underbrace{d(d(\ldots d(a_0)\ldots))}_{n\text{ times}}}.\] Show that for all integers \(n\ge1\), we have \(a_n\le3n\). [i]Proposed by Karthik Vedula[/i]

What is the largest number of parts into which $n$ planes can divide space? We assume that the set of planes is non-degenerate in the sense that any three planes intersect in one point and no four planes have a common point (and for n=2 it is necessary to require that the planes are not parallel).

One day the Beverage Barn sold $252$ cans of soda to $100$ customers, and every customer bought at least one can of soda. What is the maximum possible median number of cans of soda bought per customer on that day? $\textbf{(A) }2.5\qquad\textbf{(B) }3.0\qquad\textbf{(C) }3.5\qquad\textbf{(D) }4.0\qquad \textbf{(E) }4.5$

For dessert, Melinda eats a spherical scoop of ice cream with diameter $2$ inches. She prefers to eat her ice cream in cube-like shapes, however. She has a special machine which, given a sphere placed in space, cuts it through the planes $x = n$, $y = n$, and $z = n$ for every integer $n$ (not necessarily positive). Melinda centers the scoop of ice cream uniformly at random inside the cube $0 \le x, y,z \le 1$, and then cuts it into pieces using her machine. What is the expected number of pieces she cuts the ice cream into?

Circles of radius 3 and 6 are externally tangent to each other and are internally tangent to a circle of radius 9. The circle of radius 9 has a chord that is a common external tangent of the other two circles. Find the square of the length of this chord.

Define the Fibanocci sequence recursively by $F_1=1$, $F_2=1$ and $F_{i+2} = F_i + F_{i+1}$ for all $i$. Prove that for all integers $b,c>1$, there exists an integer $n$ such that the sum of the digits of $F_n$ when written in base $b$ is greater than $c$. [i]Proposed by Ryan Alweiss[/i]

A line $ l$ is tangent to a circle $ S$ at $ A$. For any points $ B,C$ on $ l$ on opposite sides of $ A$, let the other tangents from $ B$ and $ C$ to $ S$ intersect at a point $ P$. If $ B,C$ vary on $ l$ so that the product $ AB \cdot AC$ is constant, find the locus of $ P$.

Let $n \geq 2$ be an integer. There are $n$ distinct circles in general position, that is, any two of them meet in two distinct points and there are no three of them meeting at one point. Those circles divide the plane in limited regions by circular edges, that meet at vertices (note that each circle have exactly $2n-2$ vertices). For each circle, temporarily color its vertices alternately black and white (note that, doing this, each vertex is colored twice, one for each circle passing through it). If the two temporarily colouring of a vertex coincide, this vertex is definitely colored with this common color; otherwise, it will be colored with gray. Show that if a circle has more than $n-2 + \sqrt{n-2}$ gray points, all vertices of some region are grey. Observation: In this problem, a region cannot contain vertices or circular edges on its interior. Also, the outer region of all circles also counts as a region.

Find all functions $f :Z_{>0} \to Z_{>0}$ such that the number $xf(x) + f ^2(y) + 2xf(y)$ is a perfect square for all positive integers $x,y$.

The bases of a right hexagonal prism are regular hexagons of side length $s > 0$, and the prism has height $h$. The prism contains some water, and when it is placed on a flat surface with a hexagonal face on the bottom, the water has depth $\frac{s\sqrt3}{4}$. The water depth doesn’t change when the prism is turned so that a rectangular face is on the bottom. Compute $\frac{h}{s}$.

Find the sum of all positive integers $1\leq k\leq 99$ such that there exist positive integers $a$ and $b$ with the property that \[x^{100}-ax^k+b=(x^2-2x+1)P(x)\] for some polynomial $P$ with integer coefficients. [i]Proposed by David Altizio[/i]

Let $K$ be a point in the interior of an acute triangle $ABC$ and $ARBPCQ$ be a convex hexagon whose vertices lie on the circumcircle $\Gamma$ of the triangle $ABC.$ Let $A_1$ be the second point where the circle passing through $K$ and tangent to $\Gamma$ at $A$ intersects the line $AP.$ The points $B_1$ and $C_1$ are defined similarly. Prove that \[ \min\left\{\frac{PA_1}{AA_1}, \: \frac{QB_1}{BB_1}, \: \frac{RC_1}{CC_1}\right\} \leq 1.\]

Alex Lishkov is trying to guess sequence of $2009$ random ternary digits ($0, 1$, or $2$). After he guesses each digit, he finds out whether he was right or not. If he guesses incorrectly, and $k$ was the correct answer, then an oracle tells him what the next $k$ digits will be. Being Bulgarian, Lishkov plays to maximize the expected number of digits guessed correctly. Let $P_n$ be the probability that Lishkov guesses the nth digit correctly. Find $P_{2009}$. Write your answer in the form $x + yRe(\rho^k)$, where $x$ and $y$ are rational, $\rho$ is complex, and $k$ is a positive integer

Let $A,B,C,D,E$ be consecutive points on a circle with center $O$ such that $AC=BD=CE=DO$. Let $H_1,H_2,H_3$ be the orthocenters triangles $ACD,BCD,BCE$ respectively. Prove that the triangle $H_1H_2H_3$ is right.

On the extension of chord $AB$ of a circle centroid at $O$ a point $X$ is taken and tangents $XC$ and $XD$ to the circle are drawn from it with $C$ and $D$ lying on the circle, let $E$ be the midpoint of the line segment $CD$. If $\angle OEB = 140^o$ then determine with proof the magnitude of $\angle AOB$.