An $n \times n$ array of numbers is given. $n$ is odd and each number in the array is $1$ or $-1$. Prove that the number of rows and columns containing an odd number of $-1$s cannot total $n$.

Let $ABC$ be an acute triangle such that $\angle BAC \neq 60^\circ$. Let $D,E$ be points such that $BD,CE$ are tangent to the circumcircle of $ABC$ and $BD=CE=BC$ ($A$ is on one side of line $BC$ and $D,E$ are on the other side). Let $F,G$ be intersections of line $DE$ and lines $AB,AC$. Let $M$ be intersection of $CF$ and $BD$, and $N$ be intersection of $CE$ and $BG$. Prove that $AM=AN$.

Construct a geometric gure in a sequence of steps. In step $1$, begin with a $4\times 4$ square. In step $2$, attach a $1\times 1$ square onto the each side of the original square so that the new squares are on the outside of the original square, have a side along the side of the original square, and the midpoints of the sides of the original square and the attached square coincide. In step $3$, attach a $\frac14\times  \frac14$ square onto the centers of each of the $3$ exposed sides of each of the $4$ squares attached in step $2$. For each positive integer $n$, in step $n + 1$, attach squares whose sides are $\frac14$ as long as the sides of the squares attached in step n placing them at the centers of the $3$ exposed sides of the squares attached in step $n$. The diagram shows the gure after step $4$. If this is continued for all positive integers $n$, the area covered by all the squares attached in all the steps is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [img]https://cdn.artofproblemsolving.com/attachments/2/1/d963460373b56906e93c4be73bc6a15e15d0d6.png[/img]

If ${a, b}$ and $c$ are positive real numbers, prove that \begin{align*} a ^ 3b ^ 6 + b ^ 3c ^ 6 + c ^ 3a ^ 6 + 3a ^ 3b ^ 3c ^ 3 &\ge{ abc \left (a ^ 3b ^ 3 + b ^ 3c ^ 3 + c ^ 3a ^ 3 \right) + a ^ 2b ^ 2c ^ 2 \left (a ^ 3 + b ^ 3 + c ^ 3 \right)}. \end{align*} [i](Montenegro).[/i]

Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ (where $\mathbb{Z}$ is the set of all integers) such that \[ 2000f(f(x)) - 3999f(x) + 1999x = 0\textrm{ for all }x \in \mathbb{Z}. \]

In a billiard with shape of a rectangle $ABCD$ with $AB=2013$ and $AD=1000$, a ball is launched along the line of the bisector of $\angle BAD$. Supposing that the ball is reflected on the sides with the same angle at the impact point as the angle shot , examine if it shall ever reach at vertex B.

Given integer $n \geq 3$. There are $n$ dots marked $1$ to $n$ clockwise on a big circle. And between every two neighboring dots, there is a light. At first, every light were dark. A and B are playing a game, A pick up $n$ pairs from $\{ (i,j)|1 \leq i < j \leq n \}$ and for every pairs $(i,j)$. B starts from the point marked $i$ and choose to walk clockwise or counterclockwise to the point marked $j$. And B invert the status of all passing lights (bright $\leftrightarrow$ dark) A hopes the number of dark light can be as much as possible while B hopes the number of bright light can be as much as possible. Suppose A, B are both smart, how many lights are bright in the end? [i]Proposed by BlessingOfHeaven[/i] [img]https://pbs.twimg.com/profile_images/1014932415201120256/u9KAaMZ4_400x400.jpg[/img]

$S$ and $S'$ are two intersecting spheres. The line $BXB'$ is parallel to the line of centers, where $B$ is a point on $S, B'$ is a point on $S'$ and $X$ lies on both spheres. $A$ is another point on $S$, and $A'$ is another point on S' such that the line $AA'$ has a point on both spheres. Show that the segments $AB$ and $A'B'$ have equal projections on the line $AA'$.

Determine all the pairs of positive real numbers $(a, b)$ with $a < b$ such that the following series $$\sum_{k=1}^{\infty} \int_a^b\{x\}^k dx =\int_a^b\{x\} dx + \int_a^b\{x\}^2 dx + \int_a^b\{x\}^3 dx + \cdots$$ is convergent and determine its value in function of $a$ and $b$. [b]Note: [/b] $\{x\} = x - \lfloor x \rfloor$ denotes the fractional part of $x$.

A binoku is a $9 \times 9$ grid that is divided into nine $3 \times 3$ subgrids with the following properties: - each cell contains either a $0$ or a $1$, - each row contains at least one $0$ and at least one $1$, - each column contains at least one $0$ and at least one $1$, and - each of the nine subgrids contains at least one $0$ and at least one $1$. An incomplete binoku is obtained from a binoku by removing the numbers from some of the cells. What is the largest number of empty cells that an incomplete binoku can contain if it can be completed into a binoku in a unique way? [i]Proposed by Stijn Cambie, South Korea[/i]

Let $ P(x,y)$ be a polynomial in two variables $ x,y$ such that $ P(x,y)\equal{}P(y,x)$ for every $ x,y$ (for example, the polynomial $ x^2\minus{}2xy\plus{}y^2$ satisfies this condition). Given that $ (x\minus{}y)$ is a factor of $ P(x,y)$, show that $ (x\minus{}y)^2$ is a factor of $ P(x,y)$.

Maryam labels each vertex of a tetrahedron with the sum of the lengths of the three edges meeting at that vertex. She then observes that the labels at the four vertices of the tetrahedron are all equal. For each vertex of the tetrahedron, prove that the lengths of the three edges meeting at that vertex are the three side lengths of a triangle.

Prove that if two medians in a triangle are equal in length, then the triangle is isosceles. (Note: A median in a triangle is a segment which connects a vertex of the triangle to the midpoint of the opposite side of the triangle.)

Eric rolls a ten-sided die (with sides labeled $1$ through $10$) repeatedly until it lands on $3, 5$, or $7$. Conditional on all of Eric’s rolls being odd, the expected number of rolls can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Two white pentagonal pyramids, with side lengths all the same, are glued to each other at their regular pentagon bases. Some of the resulting $10$ faces are colored black. How many rotationally distinguishable colorings may result?

Let $ABC$ be an acute triangle with circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$ and let $M$ be the midpoint of $OD$. The points $O_b$ and $O_c$ are the circumcenters of triangles $AOC$ and $AOB$, respectively. If $AO=AD$, prove that points $A$, $O_b$, $M$ and $O_c$ are concyclic. [i]Marin Hristov and Bozhidar Dimitrov, Bulgaria[/i]

[u]Round 1[/u] [b]p1.[/b] Alex is on a week-long mining quest. Each morning, she mines at least $1$ and at most $10$ diamonds and adds them to her treasure chest (which already contains some diamonds). Every night she counts the total number of diamonds in her collection and finds that it is divisible by either $22$ or $25$. Show that she miscounted. [b]p2.[/b] Hermione set out a row of $11$ Bertie Bott’s Every Flavor Beans for Ron to try. There are $5$ chocolateflavored beans that Ron likes and $6$ beans flavored like earwax, which he finds disgusting. All beans look the same, and Hermione tells Ron that a chocolate bean always has another chocolate bean next to it. What is the smallest number of beans that Ron must taste to guarantee he finds a chocolate one? [b]p3.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [b]p4.[/b] There are $100$ food trucks in a circle and $10$ gnomes who sample their menus. For the first course, all the gnomes eat at different trucks. For each course after the first, gnome #$1$ moves $1$ truck left or right and eats there; gnome #$2$ moves $2$ trucks left or right and eats there; ... gnome #$10$ moves $10$ trucks left or right and eats there. All gnomes move at the same time. After some number of courses, each food truck had served at least one gnome. Show that at least one gnome ate at some food truck twice. [b]p5.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company lays lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses.The Edison lighting company hangs strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [u]Round 2[/u] [b]p6.[/b] What is the largest number of zeros that could appear at the end of $1^n + 2^n + 3^n + 4^n$, where n can be any positive integer? [b]p7.[/b] A tennis academy has $2023$ members. For every group of 1011 people, there is a person outside of the group who played a match against everyone in it. Show there is someone who has played against all $2022$ other members. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $O$ be the circumcenter of a triangle$ ABC$. Let $M$ be the midpoint of $AO$. The $BO$ and $CO$ intersect the altitude $AD$ at points $E$ and $F$,respectively. Let $O1$ and$ O2$ be the circumcenters of the triangle ABE and $ACF$, respectively. Prove that M lies on $O1O2$.

Find all functions $f:(0,\infty)\mapsto\mathbb{R}$ such that $\displaystyle{(y^2+1)f(x)-yf(xy)=yf\left(\frac{x}{y}\right),}$ for every $x,y>0$.

$480$ $1$ cm unit cubes are used to build a block measuring $6$ cm by $8$ cm by $10$ cm. A tiny ant then chews his way in a straight line from one vertex of the block to the furthest vertex. How many cubes does the ant pass through? The ant is so tiny that he does not "pass through" cubes if he is merely passing through where their edges or vertices meet. [i]2017 CCA Math Bonanza Individual Round #11[/i]

Find the largest number $\lambda$ such that $a^2+b^2+c^2+d^2 \geq ab + \lambda bc + cd$ for all real numbers $a,b,c,d$

Let $a_1, a_2, ..., a_{1999}$ be nonnegative real numbers satisfying the following conditions: a. $a_1+a_2+...+a_{1999}=2$ b. $a_1a_2+a_2a_3+...+a_{1999}a_1=1$. Let $S=a_1^ 2+a_2 ^ 2+...+a_{1999}^2$. Find the maximum and minimum values of $S$.

$b_0, b_1, b_2, \dots$ is a sequence of positive reals such that the sequence $b_0,c b_1, c^2b_2,c^3b_3,\dots$ is convex for all $c > 0$. (A sequence is convex if each term is at most the arithmetic mean of its two neighbors.) Show that $\ln b_0, \ln b_1, \ln b_2, \dots$ is convex.

Let $x<y$ be positive integers and $P=\frac{x^3-y}{1+xy}$. Find all integer values that $P$ can take.

Let $b_1$, $\dots$ , $b_n$ be nonnegative integers with sum $2$ and $a_0$, $a_1$, $\dots$ , $a_n$ be real numbers such that $a_0=a_n=0$ and $|a_i-a_{i-1}|\leq b_i$ for each $i=1$, $\dots$ , $n$. Prove that $$\sum_{i=1}^n(a_i+a_{i-1})b_i\leq 2$$ [hide]I believe that the original problem was for nonnegative real numbers and it was a typo on the version of the exam paper we had but I'm not sure the inequality would hold[/hide]