If $ n$ is any whole number, $ n^2(n^2 \minus{} 1)$ is always divisible by $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 24 \qquad\textbf{(C)}\ \text{any multiple of }12 \qquad\textbf{(D)}\ 12 \minus{} n \qquad\textbf{(E)}\ 12\text{ and }24$

[b]3A.[/b] Sudoku, the popular math game that caught on internationally before making its way here to the United States, is a game of logic based on a grid of $9$ rows and $9$ columns. This grid is subdivided into $9$ squares (“subgrids”) of length $3$. A successfully completed Sudoku puzzle fills this grid with the numbers $1$ through $9$ such that each number appears only once in each row, column, and individual $3 \times 3$ subgrid. Each Sudoku puzzle has one and only one correct solution. Complete the following Sudoku puzzle, and find the sum of the numbers represented by $X, Y$, and $Z$ in the grid. [i](1 point)[/i] $\begin{tabular}{|l|l|l|l|l|l|l|l|l|} \hline & & 2 & 9 & 7 & 4 & & & \\ \hline & Z & & & & & & 5 & 7 \\ \hline & & & & & & Y & & \\ \hline & & 4 & & 5 & & & & 2 \\ \hline & & 9 & X & 1 & & 6 & & \\ \hline 8 & & & & 3 & & 4 & & \\ \hline & & & & & & & & \\ \hline 1 & 3 & & & & & & & \\ \hline & & & 6 & 8 & 2 & 9 & & \\ \hline \end{tabular}$ [b]3B.[/b] Let $A$ equal the correct answer from [b]3A[/b]. In triangle $WXY$, $tan \angle YWX= (A + 8) / .5A$, and the altitude from $W$ divides $XY$ into segments of $3$ and $A + 3$. What is the sum of the digits of the square of the area of the triangle? [i](2 points)[/i] [b]3C.[/b] Let $B$ equal the correct answer from [b]3B[/b]. If a student team taking the $2005$ iTest solves $B$ problems correctly, and the probability that this student team makes over a $18$ is $x/y$ where $x$ and $y$ are relatively prime, find $x + y$. Assume that each chain reaction question – all $3$ parts it contains – counts as a single problem. Also assume that the student team does not attempt any tiebreakers. [i](4 points)[/i] [i][Note for problem 3C beacuse you might not know how points are given at that iTest: Part A (aka Short Answer), has 40 problems of 1 point each, total 40 Part B (aka Chain Reaction), has 3 problems of 7,6,7 points each, total 20 Part C (aka Long Answer), has 5 problems of 8 point each, total 40 all 3 parts add to 100 points totally ([url=https://artofproblemsolving.com/community/c3176431_itest_2005]here [/url] is that test)][/i] [hide=ANSWER KEY]3A.14 3B. 4 3C. 6563 [/hide]

We say that a positive integer is super odd if all of its digits are odd. For example, 1737 is super odd and 3051 is not. Find an even positive integer that cannot be express as a sum of two super odd numbers and explain why it is not possible to express it thus.

Determine all functions $f : R_+ \to R$ such that:$$f(x)f(y) = f(xy) + \frac{1}{x} + \frac{1}{y}$$ for all $x, y$ positive reals.

Prove that given three positive numbers, we can choose two of them, say $x$ and $y,$ with $x >y$ such that $$\frac{x-y}{1 +xy }<1.$$ Prove also that if the number $1$ that appears in the second member of the previous inequality is replaced by a lower number, even if very close to $1$, the previous proposition is false.

Five students have the first names Clark, Donald, Jack, Robin and Steve, and have the last names (in a different order) Clarkson, Donaldson, Jackson, Robinson and Stevenson. It is known that Clark is $1$ year older than Clarkson, Donald is $2$ years older than Donaldson, Jack is $3$ years older than Jackson, Robin is $4$ years older than Robinson. Who is older, Steve or Stevenson and what is the difference in their ages?

Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times{2n}$ grid of unit squares. A [i]domino[/i] is a $1\times2{}$ or $2\times{1}$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is [i]domino-tileable[/i] if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. [i]Note[/i]: The empty set is domino tileable. An [i]up-right path[/i] is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares. Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.

Prove that for every prime number $p$, there are infinitely many positive integers $n$ such that $p$ divides $2^n - n$.

Find remainder when dividing upon $2012$ number $$A=1\cdot2+2\cdot3+3\cdot4+...+2009\cdot2010+2010\cdot2011$$

Let triangle $ABC$ be a right triangle in the xy-plane with a right angle at $C$. Given that the length of the hypotenuse $AB$ is 60, and that the medians through $A$ and $B$ lie along the lines $y=x+3$ and $y=2x+4$ respectively, find the area of triangle $ABC$.

Do there exist $2024$ non-zero reals $a_1, a_2, \ldots, a_{2024}$, such that $$\sum_{i=1}^{2024}(a_i^2+\frac{1}{a_i^2})+2\sum_{i=1}^{2024} \frac{a_i} {a_{i+1}}+2024=2\sum_{i=1}^{2024}(a_i+\frac{1}{a_i})?$$

A scientist walking through a forest recorded as integers the heights of $5$ trees standing in a row. She observed that each tree was either twice as tall or half as tall as the one to its right. Unfortunately some of her data was lost when rain fell on her notebook. Her notes are shown below, with blanks indicating the missing numbers. Based on her observations, the scientist was able to reconstruct the lost data. What was the average height of the trees, in meters? $$ \begingroup \setlength{\tabcolsep}{10pt} \renewcommand{\arraystretch}{1.5} \begin{tabular}{|c|c|} \hline Tree 1 & \rule{0.4cm}{0.15mm} meters \\ Tree 2 & 11 meters \\ Tree 3 & \rule{0.5cm}{0.15mm} meters \\ Tree 4 & \rule{0.5cm}{0.15mm} meters \\ Tree 5 & \rule{0.5cm}{0.15mm} meters \\ \hline Average height & \rule{0.5cm}{0.15mm}\text{ .}2 meters \\ \hline \end{tabular} \endgroup$$ $\newline \textbf{(A) }22.2 \qquad \textbf{(B) }24.2 \qquad \textbf{(C) }33.2 \qquad \textbf{(D) }35.2 \qquad \textbf{(E) }37.2$

Let $ f(x) \equal{} a \sin^2x \plus{} b \sin x \plus{} c,$ where $ a, b,$ and $ c$ are real numbers. Find all values of $ a, b$ and $ c$ such that the following three conditions are satisfied simultaneously: [b](i)[/b] $ f(x) \equal{} 381$ if $ \sin x \equal{} \frac{1}{2}.$ [b](ii)[/b] The absolute maximum of $ f(x)$ is $ 444.$ [b](iii)[/b] The absolute minimum of $ f(x)$ is $ 364.$

In a given right triangle $ABC$, the hypotenuse $BC$, of length $a$, is divided into $n$ equal parts ($n$ and odd integer). Let $\alpha$ be the acute angel subtending, from $A$, that segment which contains the mdipoint of the hypotenuse. Let $h$ be the length of the altitude to the hypotenuse fo the triangle. Prove that: \[ \tan{\alpha}=\dfrac{4nh}{(n^2-1)a}. \]

Prove that any permutation group of an order equal to a power of $ 2 $ contains a commutative subgroup whose order is the square of the exponent of the order of the group.

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Does there exist a subset $M$ of positive integers such that for all positive rational numbers $r<1$ there exists exactly one finite subset of $M$ like $S$ such that sum of reciprocals of elements in $S$ equals $r$.

If $\tan x + \tan y = 4$ and $\cot x + \cot y = 5$, compute $\tan(x + y)$.

Does there exist two unfair dices such that probability of their sum being $j$ be a number in $\left(\frac2{33},\frac4{33}\right)$ for each $2\leq j\leq 12$?

Seven dwarfs live in one house and each has its own hat. One morning one day, two dwarfs inadvertently exchanged hats. At any time, any three gnomes can sit down at the round table and exchange hats clockwise. Is it possible that by evening all the gnomes will be with their hats.

For $x \neq 0$, $\frac{1}{x}+ \frac{1}{2x}+\frac{1}{3x}$ equals $\text{(A)}\ \frac{1}{2x} \qquad \text{(B)}\ \frac{1}{6} \qquad \text{(C)}\ \frac{5}{6x} \qquad \text{(D)}\ \frac{11}{6x} \qquad \text{(E)}\ \frac{1}{6x^3}$

Find all prime numbers $p, q, r$ such that \[15p+7pq+qr=pqr.\]

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]

Let $n$ be a positive integer, $n \geq 1$ and $x_1,x_2,...,x_n$ positive real numbers such that $x_1+x_2+...+x_n=1$. Does the following inequality hold $$\sum_{i=1}^{n} {\frac{x_i}{1-x_1\cdot...\cdot x_{i-1} \cdot x_{i+1} \cdot ... x_n}} \leq \frac{1}{1-\left(\frac{1}{n}\right)^{n-1}} $$