Let $n$ be a positive integers. Equilateral triangle with sides of length $n$ is split into equilateral triangles with side lengths $1$, forming a triangular lattice. Call an equilateral triangle with vertices in the lattice "important". Let $p_k$ be the number of unordered pairs of vertices in the lattice which participate in exactly $k$ important triangles. Find (as a function of $n$) (a) $p_0+p_1+p_2$ (b) $p_1+2p_2$

Consider a finite group $ G $ and the sequence of functions $ \left( A_n \right)_{n\ge 1} :G\longrightarrow \mathcal{P} (G) $ defined as $ A_n(g) = \left\{ x\in G|x^n=g \right\} , $ where $ \mathcal{P} (G) $ is the power of $ G. $ [b]a)[/b] Prove that if $ G $ is commutative, then for any natural numbers $ n, $ either $ A_n(g) =\emptyset , $ or $ \left| A_n(g) \right| =\left| A_n(1) \right| . $ [b]b)[/b] Provide an example of what $ G $ could be in the case that there exists an element $ g_0 $ of $ G $ and a natural number $ n_0 $ such that $ \left| A_{n_0}\left( g_0 \right) \right| >\left| A_{n_0}(1) \right| . $ [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]

Let $ f(x)$ be a continuous function defined in the interval $ 0\leq x\leq 1.$ Prove that $ \int_0^1 xf(x)f(1\minus{}x)\ dx\leq \frac{1}{4}\int_0^1 \{f(x)^2\plus{}f(1\minus{}x)^2\}\ dx.$

Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.

A calculator treats angles as radians. It initially displays 1. What is the largest value that can be achieved by pressing the buttons cos or sin a total of 2001 times? (So you might press cos five times, then sin six times and so on with a total of 2001 presses.)

[b]Randy:[/b] "Hi Rachel, that's an interesting quadratic equation you have written down. What are its roots?'' [b]Rachel:[/b] "The roots are two positive integers. One of the roots is my age, and the other root is the age of my younger brother, Jimmy.'' [b]Randy:[/b] "That is very neat! Let me see if I can figure out how old you and Jimmy are. That shouldn't be too difficult since all of your coefficients are integers. By the way, I notice that the sum of the three coefficients is a prime number.'' [b]Rachel:[/b] "Interesting. Now figure out how old I am.'' [b]Randy:[/b] "Instead, I will guess your age and substitute it for $x$ in your quadratic equation $\dots$ darn, that gives me $-55$, and not $0$.'' [b]Rachel:[/b] "Oh, leave me alone!'' (1) Prove that Jimmy is two years old. (2) Determine Rachel's age.

From the set of all permutations $f$ of $\{1, 2, ... , n\}$ that satisfy the condition: $f(i) \geq i-1$ $i=1,...,n$ one is chosen uniformly at random. Let $p_n$ be the probability that the chosen permutation $f$ satisfies $f(i) \leq i+1$ $i=1,...,n$ Find all natural numbers $n$ such that $p_n > \frac{1}{3}$.

For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.

Let $f:[0,1]\to\mathbb R$ be a given continuous function. Find the limit $$\lim_{n\to\infty}(n+1)\sum_{k=0}^n\int^1_0x^k(1-x)^{n-k}f(x)dx.$$

For any positive integer $n$, define $f(n)$ to be the smallest positive integer that does not divide $n$. For example, $f(1)=2$, $f(6)=4$. Prove that for any positive integer $n$, either $f(f(n))$ or $f(f(f(n)))$ must be equal to $2$.

The function $f : \mathbb{R}\to\mathbb{R}$ satisfies $f(x^2)f^{\prime\prime}(x)=f^\prime (x)f^\prime (x^2)$ for all real $x$. Given that $f(1)=1$ and $f^{\prime\prime\prime}(1)=8$, determine $f^\prime (1)+f^{\prime\prime}(1)$.

Consider the sets $A = \{0,1,2\},$ and $B = \{1,2,3,4,5\}.$ Find the number of functions $f: A \to B$ such that $x + f(x) + xf(x)$ is odd for all $x.$ (A function $f:A \to B$ is a rule that assigns to every number in $A$ a number in $B.$) \[\mathrm a. ~15\qquad \mathrm b. ~27 \qquad \mathrm c. ~30 \qquad\mathrm d. ~42\qquad\mathrm e. ~45\]

Let \( n \) be a positive integer. A function \( f : \{0, 1, \dots, n\} \to \{0, 1, \dots, n\} \) is called \( n \)-Bolivian if it satisfies the following conditions: • \( f(0) = 0 \); • \( f(t) \in \{ t-1, f(t-1), f(f(t-1)), \dots \} \) for all \( t = 1, 2, \dots, n \). For example, if \( n = 3 \), then the function defined by \( f(0) = f(1) = 0 \), \( f(2) = f(3) = 1 \) is 3-Bolivian, but the function defined by \( f(0) = f(1) = f(2) = 0 \), \( f(3) = 1 \) is not 3-Bolivian. For a fixed positive integer \( n \), Gollum selects an \( n \)-Bolivian function. Smeagol, knowing that \( f \) is \( n \)-Bolivian, tries to figure out which function was chosen by asking questions of the type: \[ \text{How many integers } a \text{ are there such that } f(a) = b? \] given a \( b \) of his choice. Show that if Gollum always answers correctly, Smeagol can determine \( f \) and find the minimum number of questions he needs to ask, considering all possible choices of \( f \).

Find all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy \[f(x^2 + y) + f(f(x) - y) = 2f(f(x)) + 2y^2\quad\text{ for all }x, y \in \mathbb{R}.\]

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all real numbers $x$ and $y$, $$(f(x)+xy)\cdot f(x-3y)+(f(y)+xy)\cdot f(3x-y)=(f(x+y))^2.$$

For $f(x)$ a positive , monotone decreasing function defined in $[0,1],$ prove that $$ \int_{0}^{1} f(x) dx \cdot \int_{0}^{1} xf(x)^{2} dx \leq \int_{0}^{1} f(x)^{2} dx \cdot \int_{0}^{1} xf(x) dx.$$

Let $ S$ be the set of nonnegative real numbers. Find all functions $ f: S\rightarrow S$ which satisfy $ f(x\plus{}y\minus{}z)\plus{}f(2\sqrt{xz})\plus{}f(2\sqrt{yz})\equal{}f(x\plus{}y\plus{}z)$ for all nonnegative $ x,y,z$ with $ x\plus{}y\ge z$.

Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: [list][*] $f(2)=2$, [*] $f(mn)=f(m)f(n)$, [*] $f(n+1)>f(n)$. [/list]

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

Define a function $f(n)$ from the positive integers to the positive integers such that $f(f(n))$ is the number of positive integer divisors of $n$. Prove that if $p$ is a prime, then $f(p)$ is prime.

10) Call a string of letters $S$ an [i]almost-palindrome[/i] if $S$ and the reverse of $S$ differ in exactly $2$ places. Find the number of ways to order the letters in $HMMTTHEMETEAM$ to get an almost-palindrome. 11) Find all integers $n$, not necessarily positive, for which there exist positive integers ${a,b,c}$ satisfying $a^n + b^n = c^n$. 12) Let $a$ and $b$ be positive real numbers. Determine the minimum possible value of $\sqrt{a^2 + b^2} + \sqrt{a^2 + (b-1)^2} + \sqrt{(a-1)^2 + b^2} + \sqrt{(a-1)^2 + (b-1)^2}$. 13) Consider a $4$ x $4$ grid of squares, each originally colored red. Every minute, Piet can jump on any of the squares, changing the color of it and any adjacent squares to blue (two squares are adjacent if they share a side). What is the minimum number of minutes it will take Piet to change the entire grid to blue? 14) Let $ABC$ be an acute triangle with orthocenter $H$. Let ${D,E}$ be the feet of the ${A,B}$-altitudes, respectively. Given that $\overline{AH} = 20$ and $\overline{HD} =16$ and $\overline{BE} = 56$, find the length of $\overline{BH}$. 15) Find the smallest positive integer $b$ such that $1111 _b$ ($1111$ in base $b$) is a perfect square. If no such $b$ exists, write "No Solution" 16) For how many triples $( {x,y,z} )$ of integers between $-10$ and $10$, inclusive, do there exist reals ${a,b,c}$ that satisfy $ab = x$ $ac = y$ $bc = z$? 17) Unit squares $ABCD$ and $EFGH$ have centers $O_1$ and $O_2$, respectively, and are originally oriented so that $B$ and $E$ are at the same position and $C$ and $H$ are at the same position. The squares then rotate clockwise around their centers at a rate of one revolution per hour. After $5$ minutes, what is the area of the intersection of the two squares? 18) A function $f$ satisfies, for all nonnegative integers $x$ and $y$, $f(x,0) = f(0,x) = x$ If $x \ge y \ge 0$, $f(x,y)=f(x-y,y)+1$ If $y \ge x \ge 0$, $f(x,y) = f(x,y-x)+1$ Find the maximum value of $f$ over $0 \le x,y \le 100$.

Find constants $A > B$ such that $\frac{f\left( \frac{1}{1+2x}\right) }{f(x)}$ is independent of $x$, where $f(x) = \frac{1 + Ax}{1 + Bx}$ for all real $x \ne - \frac{1}{B}$. Put $a_0 = 1$, $a_{n+1} = \frac{1}{1 + 2a_n}$. Find an expression for an by considering $f(a_0), f(a_1), ...$.

Let $n$ be a positive integer. $S_1, S_2, \ldots, S_n$ are pairwise non-intersecting sets, and $S_k $ has exactly $k$ elements $(k = 1, 2, \ldots, n)$. Define $S = S_1\cup S_2\cup\cdots \cup S_n$. The function $f: S \to S $ maps all elements in $S_k$ to a fixed element of $S_k$, $k = 1, 2, \ldots, n$. Find the number of functions $g: S \to S$ satisfying $f(g(f(x))) = f(x).$

Evaluate $ \int_0^{\pi} \frac{x\sin ^ 3 x}{\sin ^ 2 x\plus{}8}dx$.

Find all functions $f: \mathbb{Q}\to \mathbb{R}$ such that for all $x,y\in \mathbb{Q}$: \[f(xy)=f(x)f(y)-f(x+y)+1.\]