If $ m,n\in Z$, then $ m^{2} \plus{} 3mn \minus{} 4n^{2}$ cannot be $\textbf{(A)}\ 69 \qquad\textbf{(B)}\ 76 \qquad\textbf{(C)}\ 91 \qquad\textbf{(D)}\ 94 \qquad\textbf{(E)}\ \text{None}$

Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

For each $1\leq i\leq 9$ and $T\in\mathbb N$, define $d_i(T)$ to be the total number of times the digit $i$ appears when all the multiples of $1829$ between $1$ and $T$ inclusive are written out in base $10$. Show that there are infinitely many $T\in\mathbb N$ such that there are precisely two distinct values among $d_1(T)$, $d_2(T)$, $\dots$, $d_9(T)$.

A jar contains $97$ marbles that are either red, green, or blue. Neil draws two marbles from the jar without replacement and notes that the probability that they would be the same color is $\tfrac{5}{12}.$ After Neil puts his marbles back, Jerry draws two marbles from the jar with replacement. Compute the probability that the marbles that Jerry draws are the same color.

Integers $x,y,z$ and $a,b,c$ satisfy $$x^2+y^2=a^2,\enspace y^2+z^2=b^2\enspace z^2+x^2=c^2.$$Prove that the product $xyz$ is divisible by (a) $5$, and (b) $55$.

Let ABCD be a quadrilateral; X and Y be the midpoints of AC and BD respectively and lines through X and Y respectively parallel to BD, AC meet in O. Let P,Q,R,S be the midpoints of AB, BC, CD, DA respectively. Prove that (A) APOS and APXS have the same area (B) APOS, BQOP, CROQ, DSOR have the same area.

Let $ABCDEF$ be a regular hexagon and $P$ be a point on the shorter arc $EF$ of its circumcircle. Prove that the value of $$\frac{AP+BP+CP+DP}{EP+FP}$$is constant and find its value.

The vertices of a regular $2005$-gon are colored red, white and blue. Whenever two vertices of different colors stand next to each other, we are allowed to recolor them into the third color. (a) Prove that there exists a finite sequence of allowed recolorings after which all the vertices are of the same color. (b) Is that color uniquely determined by the initial coloring?

The infinity sequence $r_{1},r_{2},...$ of rational numbers it satisfies that: $\prod_{i=1}^ {k}r_{i}=\sum_{i=1}^{k} r_{i}$. For all natural k. Show that $\frac{1}{r_{n}}-\frac{3}{4}$ is a square of rationale number for all natural $n\geq3$

An ant walks on the plane as follows: initially, it walks $1$ cm in any direction. After, at each step, it changes the trajectory direction by $60^o$ left or right and walks $1$ cm in that direction. It is possible that it returns to the point from which it started in (a) $2008$ steps? (b) $2009$ steps? [img]https://cdn.artofproblemsolving.com/attachments/8/b/d4c0d03c67432c4e790b465a74a876b938244c.png[/img]

In the acute-angled triangle $ABC$, on the lines $BC$, $AC$, $AB$ we consider the points $D$, $E$ and, respectively, $F$, such that $AD\perp AC, BE\perp AB, CF\perp AC$. Let the point $A', B', C'$ be such that $\{A'\}=BC\cap EF, \{B'\}=AC\cap DF, \{C'\}=AB\cap DE$. Prove that the following inequality is true $$\frac{A'F}{A'E} \cdot \frac{B'D}{B'F} \cdot \frac{C'E}{C'D}\geq8$$

Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.

Let $n$ be a positive integer. Prove that the numbers $$1^1, 3^3, 5^5, ..., (2n-1)^{2n-1}$$ all give different remainders when divided by $2^n$.

Prove for postitive $a$ and natural $n$ $$a^n+\frac{1}{a^n}-2 \geq n^2(a+\frac{1}{a}-2)$$

A square sheet of paper $ABCD$ is so folded that $B$ falls on the mid point of $M$ of $CD$. Prove that the crease will divide $BC$ in the ration $5 : 3$.

The integers $a$, $b$, $c$ and $d$ are such that $a$ and $b$ are relatively prime, $d\leq 2022$ and $a+b+c+d = ac + bd = 0$. Determine the largest possible value of $d$,

$X$ is a set with $100$ members. What is the smallest number of subsets of $X$ such that every pair of elements belongs to at least one subset and no subset has more than $50$ members? What is the smallest number if we also require that the union of any two subsets has at most $80$ members?

Point $X$ is placed on segment $AB$ of a regular hexagon $ABCDEF$ such that the ratio of the area of $AXEF$ to the area of $XBCDE$ is $\frac12$. If $AB = 2018$, find $AX$.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Is the number $1234567890987654321$ prime?

There are four boats on one of the river banks; their names are Eight, Four, Two and One, because that is the number of hours it takes each of them to cross the river. One boat can be tied to another, but not more than one, and then the time it takes to cross is equal to that of the slower of the two boats. A single sailor must take all the boats to the other shore. What is the least amount of time you need to complete the move?

If $a,b,c,d,e$ are real numbers, prove the inequality $a^2 +b^2 +c^2 +d^2+e^2 \ge a(b+c+d+e)$.

Let $ A,B,C,D$ be four distinct points on a line, in that order. The circles with diameters $ AC$ and $ BD$ intersect at $ X$ and $ Y$. The line $ XY$ meets $ BC$ at $ Z$. Let $ P$ be a point on the line $ XY$ other than $ Z$. The line $ CP$ intersects the circle with diameter $ AC$ at $ C$ and $ M$, and the line $ BP$ intersects the circle with diameter $ BD$ at $ B$ and $ N$. Prove that the lines $ AM,DN,XY$ are concurrent.

Let $x, y, z$ be real numbers such that $$x+y+z=2, \;\;\;\; xy+yz+zx=1$$ Find the maximum possible value of $x-y$.

Find all functions $f : R \to R$ such that $$f(x)f(y) = f(xy + 1) + f(x - y) - 2$$ for all $x, y \in R$.