On a chess table $n\times m$ we call a [i]move [/i] the following succesion of operations (i) choosing some unmarked squares, any two not lying on the same row or column; (ii) marking them with 1; (iii) marking with 0 all the unmarked squares which lie on the same line and column with a square marked with the number 1 (even if the square has been marked with 1 on another move). We call a [i]game [/i]a succession of moves that end in the moment that we cannot make any more moves. What is the maximum possible sum of the numbers on the table at the end of a game?

Let $ABCD$ be a cyclic quadrilateral inscribed in circle $O$, where $AC\perp BD$. $M$ be the midpoint of arc $ADC$. Circle $(DOM)$ intersect $DA,DC$ at $E,F$. Prove that $BE=BF$.

Let $\frac{1}{1-x-x^2-x^3} =\sum^{\infty}_{i=0} a_nx^n$, for what positive integers $n$ does $a_{n-1} = n^2$?

$\triangle ABC$, $AB>AC$. the incircle $I$ of $\triangle ABC$ meet $BC$ at point $D$, $AD$ meet $I$ again at $E$. $EP$ is a tangent of $I$, and $EP$ meet the extension line of $BC$ at $P$. $CF\parallel PE$, $CF\cap AD=F$. the line $BF$ meet $I$ at $M,N$, point $M$ is on the line segment $BF$, the line segment $PM$ meet $I$ again at $Q$. Show that $\angle ENP=\angle ENQ$

We have $k$ switches arranged in a row, and each switch points up, down, left, or right. Whenever three successive switches all point in different directions, all three may be simultaneously turned so as to point in the fourth direction. Prove that this operation cannot be repeated infinitely many times.

Given an acute triangle $ABC$. with $H$ as its orthocenter, lines $\ell_1$ and $\ell_2$ go through $H$ and are perpendicular to each other. Line $\ell_1$ cuts $BC$ and the extension of $AB$ on $D$ and $Z$ respectively. Whereas line $\ell_2$ cuts $BC$ and the extension of $AC$ on $E$ and $X$ respectively. If the line through $D$ and parallel to $AC$ and the line through $E$ parallel to $AB$ intersects at $Y$, prove that $X,Y,Z$ are collinear.

Find all functions \( f : \mathbb{R} \to \mathbb{R} \) that satisfy the following two conditions: \[ \left\{ \begin{array}{ll} \mbox{If } f(0) = 0, \mbox{ then } f(x) \neq 0 \mbox{ for any non-zero } x. \\ \\ f(x + y)f(y + z)f(z + x) = f(x + y + z)f(xy + yz + zx) - f(x)f(y)f(z) \quad \forall x, y, z \in \mathbb{R}. \end{array} \right. \]

Let $R$, $S$, and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the x-axis. The left edge of $R$ and the right edge of $S$ are on the $y$-axis, and $R$ contains $\frac{9}{4}$ as many lattice points as does $S$. The top two vertices of $T$ are in $R \cup S$, and $T$ contains $\frac{1}{4}$ of the lattice points contained in $R \cup S$. See the figure (not drawn to scale). [asy] //kaaaaaaaaaante314 size(8cm); import olympiad; label(scale(.8)*"$y$", (0,60), N); label(scale(.8)*"$x$", (60,0), E); filldraw((0,0)--(55,0)--(55,55)--(0,55)--cycle, yellow+orange+white+white); label(scale(1.3)*"$R$", (55/2,55/2)); filldraw((0,0)--(0,28)--(-28,28)--(-28,0)--cycle, green+white+white); label(scale(1.3)*"$S$",(-14,14)); filldraw((-10,0)--(15,0)--(15,25)--(-10,25)--cycle, red+white+white); label(scale(1.3)*"$T$",(3.5,25/2)); draw((0,-10)--(0,60),EndArrow(TeXHead)); draw((-34,0)--(60,0),EndArrow(TeXHead));[/asy] The fraction of lattice points in $S$ that are in $S \cap T$ is 27 times the fraction of lattice points in $R$ that are in $R \cap T$. What is the minimum possible value of the edge length of $R$ plus the edge length of $S$ plus the edge length of $T$? $\textbf{(A) }336\qquad\textbf{(B) }337\qquad\textbf{(C) }338\qquad\textbf{(D) }339\qquad\textbf{(E) }340$

A function $ f$ defined on the positive integers (and taking positive integers values) is given by: $ \begin{matrix} f(1) \equal{} 1, f(3) \equal{} 3 \\ f(2 \cdot n) \equal{} f(n) \\ f(4 \cdot n \plus{} 1) \equal{} 2 \cdot f(2 \cdot n \plus{} 1) \minus{} f(n) \\ f(4 \cdot n \plus{} 3) \equal{} 3 \cdot f(2 \cdot n \plus{} 1) \minus{} 2 \cdot f(n), \end{matrix}$ for all positive integers $ n.$ Determine with proof the number of positive integers $ \leq 1988$ for which $ f(n) \equal{} n.$

[b]p1.[/b] Let $D(n)$ denote the number of positive factors of the integer $n$. For example, $D(6) = 4$ , since the factors of $6$ are $1, 2, 3$ , and $6$ . Note that $D(n) = 2$ if and only if $n$ is a prime number. (a) Describe the set of all solutions to the equation $D(n) = 5$ . (b) Describe the set of all solutions to the equation $D(n) = 6$ . (c) Find the smallest $n$ such that $D(n) = 21$ . [b]p2.[/b] At a party with $n$ married couples present (and no one else), various people shook hands with various other people. Assume that no one shook hands with his or her spouse, and no one shook hands with the same person more than once. At the end of the evening Mr. Jones asked everyone else, including his wife, how many hands he or she had shaken. To his surprise, he got a different answer from each person. Determine the number of hands that Mr. Jones shook that evening, (a) if $n = 2$ . (b) if $n = 3$ . (c) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [b]p3.[/b] Let $n$ be a positive integer. A square is divided into triangles in the following way. A line is drawn from one corner of the square to each of $n$ points along each of the opposite two sides, forming $2n + 2$ nonoverlapping triangles, one of which has a vertex at the opposite corner and the other $2n + 1$ of which have a vertex at the original corner. The figure shows the situation for $n = 2$ . Assume that each of the $2n + 1$ triangles with a vertex in the original corner has area $1$. Determine the area of the square, (a) if $n = 1$ . (b) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [img]https://cdn.artofproblemsolving.com/attachments/1/1/62a54011163cc76cc8d74c73ac9f74420e1b37.png[/img] [b]p4.[/b] Arthur and Betty play a game with the following rules. Initially there are one or more piles of stones, each pile containing one or more stones. A legal move consists either of removing one or more stones from one of the piles, or, if there are at least two piles, combining two piles into one (but not removing any stones). Arthur goes first, and play alternates until a player cannot make a legal move; the player who cannot move loses. (a) Determine who will win the game if initially there are two piles, each with one stone, assuming that both players play optimally. (b) Determine who will win the game if initially there are two piles, each with $n$ stones, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . (c) Determine who will win the game if initially there are $n$ piles, each with one stone, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . [b]p5.[/b] Suppose $x$ and $y$ are real numbers such that $0 < x < y$. Define a sequence$ A_0 , A_1 , A_2, A_3, ...$ by-setting $A_0 = x$ , $A_1 = y$ , and then $A_n= |A_{n-1}| - A_{n-2}$ for each $n \ge 2$ (recall that $|A_{n-1}|$ means the absolute value of $A_{n-1}$ ). (a) Find all possible values for $A_6$ in terms of $x$ and $y$ . (b) Find values of $x$ and $y$ so that $A_{1987} = 1987$ and $A_{1988} = -1988$ (simultaneously). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are three video game systems: the Paystation, the WHAT, and the ZBoz2$\pi$, and none of these systems will play games for the other systems. Uncle Riemann has three nephews: Bernoulli, Galois, and Dirac. Bernoulli owns a Paystation and a WHAT, Galois owns a WHAT and a ZBoz2$\pi$, and Dirac owns a ZBoz2$\pi$ and a Paystation. A store sells $4$ different games for the Paystation, $6$ different games for the WHAT, and $10$ different games for the ZBoz2$\pi$. Uncle Riemann does not understand the difference between the systems, so he walks into the store and buys $3$ random games (not necessarily distinct) and randomly hands them to his nephews. What is the probability that each nephew receives a game he can play?

Let $BE$ and $CF$ be altitudes in triangle $ABC$. If $AE = 24$, $EC = 60$, and $BF = 31$, determine $AF$.

Let $ a\le b\le c$ be the sides of a right triangle, and let $ 2p$ be its perimeter. Show that \[ p(p \minus{} c) \equal{} (p \minus{} a)(p \minus{} b) \equal{} S, \] where $ S$ is the area of the triangle.

Find all positive integers $1 \le n \le 2008$ so that there exist a prime number $p \ge n$ such that $$\frac{2008^p + (n -1)!}{n}$$ is a positive integer.

The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of all possible values of $a$? $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

While Theophrastus was talking to Aristotle about the classification of plants, had a dog tied to a perfectly smooth cylindrical column of radius $r$, with a very fine rope that wrapped around the column and with a loop. The dog had the extreme free from the rope around his neck. In trying to reach Theophrastus, he put the rope tight and it broke. Find out how far from the column the knot was in the time to break the rope. [hide=original wording]Mientras Teofrasto hablaba con Arist´oteles sobre la clasificaci´on de las plantas, ten´ıa un perro atado a una columna cil´ındrica perfectamente lisa de radio r, con una cuerda muy fina que envolv´ıa la columna y con un lazo. El perro ten´ıa el extremo libre de la cuerda cogido a su cuello. Al intentar alcanzar a Teofrasto, puso la cuerda tirante y ´esta se rompi´o. Averiguar a qu´e distancia de la columna estaba el nudo en el momento de romperse la cuerda.[/hide]

Prior to the game John selects an integer greater than $100$. Then Mary calls out an integer $d$ greater than $1$. If John's integer is divisible by $d$, then Mary wins. Otherwise, John subtracts $d$ from his number and the game continues (with the new number). Mary is not allowed to call out any number twice. When John's number becomes negative, Mary loses. Does Mary have a winning strategy?

Let $n$ be a positive integer. There is a board of $(n + 1) \times (n + 1)$ whose squares are numbered in a diagonal pattern, as as the picture shows. Chepito starts from the lower left square, and moving only up or to the right until he reaches the upper right box. During his tour, Chepito writes down the number of each box on the which made a change of direction, and in the end calculates the sum of all the numbers entered. Determine the maximum value of this sum. [img]https://cdn.artofproblemsolving.com/attachments/e/d/f9dc43092a1407d6fe6f1b2c741af015079946.png[/img]

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] if it is not true that for every $n$ from $1$ to $15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there? $ \textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5 $

Find all positive integers $k$ for which number $3^k+5^k$ is a power of some integer with exponent greater than $1$.

For each positive integer $n$, decide whether it is possible to tile a square with exactly $n+1$ similar rectangles, each with a positive area and aspect ratio $1:n$.

Prove the identity $ \frac{n-1}{2}=\sum_{k=1}^n \left\{ \frac{m+k-1}{n} \right\} , $ where $ n\ge 2, m $ are natural numbers, and $ \{\} $ denotes the fractional part.

Prove that $\frac{1}{2} \frac{3}{4} \frac{5}{6} \frac{7}{8} ... \frac{99}{100 } <\frac{1}{10}$.

For a positive integer $n$, let $s(n)$ and $c(n)$ be the number of divisors of $n$ that are perfect squares and perfect cubes respectively. A positive integer $n$ is called fair if $s(n)=c(n)>1$. Find the number of fair integers less than $100$.

The incircle of a triangle $ABC$ touches the sides $BC,CA,AB$ at points $D,E,F$, respectively. Let $X$ be a point on the incircle, different from the points $D,E,F$. The lines $XD$ and $EF,XE$ and $FD,XF$ and $DE$ meet at points $J,K,L$, respectively. Let further $M,N,P$ be points on the sides $BC,CA,AB$, respectively, such that the lines $AM,BN,CP$ are concurrent. Prove that the lines $JM,KN$ and $LP$ are concurrent. [i]Dinu Serbanescu[/i]