Let $f_n\ (n=1,\ 2,\ \cdots)$ be a linear transformation expressed by a matrix $\left( \begin{array}{cc} 1-n & 1 \\ -n(n+1) & n+2 \end{array} \right)$ on the $xy$ plane. Answer the following questions: (1) Prove that there exists 2 lines passing through the origin $O(0,\ 0)$ such that all points of the lines are mapped to the same lines, then find the equation of the lines. (2) Find the area $S_n$ of the figure enclosed by the lines obtained in (1) and the curve $y=x^2$. (3) Find $\sum_{n=1}^{\infty} \frac{1}{S_n-\frac 16}.$ [i]2011 Tokyo Institute of Technlogy entrance exam, Problem 1[/i]

Real numbers $a, b$ and $c$ satisfy $$\begin{cases} a^2 + b^2 + c^2 = 1 \\ a^3 + b^3 + c^3 = 1. \end{cases}$$ Find $a + b + c$.

Positive numbers $ x_1, x_2, . . ., x_{2009}$ satisfy the equalities $$x^2_1 - x_1x_2 +x^2_2 =x^2_2 -x_2x_3+x^2_3=x^2_3 -x_3x_4+x^2_4= ...= x^2_{2008}- x_{2008}x_{2009}+x^2_{2009}= x^2_{2009}-x_{2009}x_1+x^2_1$$. Prove that the numbers $ x_1, x_2, . . ., x_{2009}$ are equal.

Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of real numbers such that $$2(a_1+a_2+…+a_n)=na_{n+1}~\forall~n \ge 1.$$ $\textbf{a)}$ Prove that the given sequence is an arithmetic progression. $\textbf{b)}$ If $\lfloor a_1 \rfloor + \lfloor a_2 \rfloor +…+ \lfloor a_n \rfloor = \lfloor a_1+a_2+…+a_n \rfloor~\forall~ n \in \mathbb{N},$ prove that every term of the sequence is an integer.

Baron Münchausen boasts that he knows a remarkable quadratic triniomial with positive coefficients. The trinomial has an integral root; if all of its coefficients are increased by $1$, the resulting trinomial also has an integral root; and if all of its coefficients are also increased by $1$, the new trinomial, too, has an integral root. Can this be true?

Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?

Solve the system of equations $$\begin{cases} \dfrac{x+y}{xy}+\dfrac{xy}{x+y}= a+ \dfrac{1}{a}\\ \\\dfrac{x-y}{xy}+\dfrac{xy}{x-y}= c+ \dfrac{1}{c}\end{cases}$$

Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]

Let's write down a segment of a series of integers from $0$ to $1995$. Among the numbers written out, two have been crossed out. Let's consider the longest arithmetic progression contained among the remaining $1994$ numbers. Let $K$ be the length of the progression. Which two numbers must be crossed out so that the value of $K$ is the smallest?

Let $ a $ be an odd natural that is not a perfect square, and $ m,n\in\mathbb{N} . $ Then [b]a)[/b] $ \left\{ m\left( a+\sqrt a \right) \right\}\neq\left\{ n\left( a-\sqrt a \right) \right\} $ [b]b)[/b] $ \left[ m\left( a+\sqrt a \right) \right]\neq\left[ n\left( a-\sqrt a \right) \right] $ Here, $ \{\},[] $ denotes the fractionary, respectively the integer part.

Prove that any integer $n$ satisfying the inequality $n <(44 + \sqrt{1975})^100 <n + 1$ is odd.

The set of natural numbers is represented as a union of pairwise disjoint subsets, whose elements form infinite arithmetic progressions with positive differences $d_1,d_2,d_3,...$. Is it possible that the sum $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$? Consider the cases where (a) the total number of progressions is finite, and (b) the number of progressions is infinite. (In this case the condition that $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$ should be taken to mean that the sum of any finite number of terms does not exceed 0.9.) (A. Tolpugo, Kiev)

If $x^5 - x ^3 + x = a,$ prove that $x^6 \geq 2a - 1$.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that all real numbers $x$ and $y$ satisfy \[f(f(x)+y)=f(x^2-y)+4f(x)y.\]

Determine all 4-tuples ($a, b,c, d$) of real numbers satisfying the following four equations: $\begin{cases} ab + c + d = 3 \\ bc + d + a = 5 \\ cd + a + b = 2 \\ da + b + c = 6 \end{cases}$

Determine all positive real solutions of the following system of equations: $$a =\ max \{ \frac{1}{b} , \frac{1}{c}\} \,\,\,\,\,\, b = \max \{ \frac{1}{c} , \frac{1}{d}\} \,\,\,\,\,\, c = \max \{ \frac{1}{d}, \frac{1}{e}\} $$ $$d = \max \{ \frac{1}{e} , \frac{1}{f }\} \,\,\,\,\,\, e = \max \{ \frac{1}{f} , \frac{1}{a}\} \,\,\,\,\,\, f = \max \{ \frac{1}{a} , \frac{1}{b}\}$$

Find the number of all infinite sequences $a_1$, $a_2$, ... of positive integers such that $a_n+a_{n+1}=2a_{n+2}a_{n+3}+2005$ for all positive integers $n$.

Let $P$ be a polynomial with real coefficients such that $P(x) > 0$ if $x > 0$. Prove that there exist polynomials $Q$ and $R$ with nonnegative coefficients such that $P(x) = \frac{Q(x)}{R(x)}$ if $x > 0.$

A car goes along a straight highway at the speed of $60$ km per hour. A $100$ meter long fence is standing parallel to the highway. Every second, the passenger of the car measures the angle of vision of the fence. Prove that the sum of all angles measured by him is less than $1100$ degrees.

Prove that the number of odd coefficients in the polynomial $(1+x)^n$ is a power of $2$ for every positive integer $N$

[b]p13.[/b] Emma has the five letters: $A, B, C, D, E$. How many ways can she rearrange the letters into words? Note that the order of words matter, ie $ABC DE$ and $DE ABC$ are different. [b]p14.[/b] Seven students are doing a holiday gift exchange. Each student writes their name on a slip of paper and places it into a hat. Then, each student draws a name from the hat to determine who they will buy a gift for. What is the probability that no student draws himself/herself? [b]p15.[/b] We model a fidget spinner as shown below (include diagram) with a series of arcs on circles of radii $1$. What is the area swept out by the fidget spinner as it’s turned $60^o$ ? [img]https://cdn.artofproblemsolving.com/attachments/9/8/db27ffce2af68d27eee5903c9f09a36c2a6edf.png[/img] [b]p16.[/b] Let $a,b,c$ be the sides of a triangle such that $gcd(a, b) = 3528$, $gcd(b, c) = 1008$, $gcd(a, c) = 504$. Find the value of $a * b * c$. Write your answer as a prime factorization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ f(x) \equal{} \log_{10} (\sin (\pi x)\cdot\sin (2\pi x)\cdot\sin (3\pi x) \cdots \sin (8\pi x))$. The intersection of the domain of $ f(x)$ with the interval $ [0,1]$ is a union of $ n$ disjoint open intervals. What is $ n$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 22 \qquad \textbf{(E)}\ 36$

Find the number of subsets $A\subset M=\{2^0,\,2^1,\,2^2,\dots,2^{2005}\}$ such that equation $x^2-S(A)x+S(B)=0$ has integral roots, where $S(M)$ is the sum of all elements of $M$, and $B=M\setminus A$ ($A$ and $B$ are not empty).

Let $P(x)$ be a polynomial with integer coefficients. Prove that the polynomial $Q(x) = P(x^4)P(x^3)P(x^2)P(x)+1$ has no integer roots.

find all functions $f,g:\mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that $f$ is increasing and also: $f(f(x)+2g(x)+3f(y))=g(x)+2f(x)+3g(y)$ $g(f(x)+y+g(y))=2x-g(x)+f(y)+y$