A total fixed amount of $N$ thousand rupees is given to $A,B,C$ every year, each being given an amount proportional to her age. In the first year, A got half the total amount. When the sixth payment was made, A got six-seventh of the amount that she had in the first year; B got 1000 Rs less than that she had in the first year, and C got twice of that she had in the first year. Find N.

A truck travels $\frac{b}{6}$ feet every $t$ seconds. There are $3$ feet in a yard. How many yards does the truck travel in $3$ minutes? $ \textbf {(A) } \frac{b}{1080t} \qquad \textbf {(B) } \frac{30t}{b} \qquad \textbf {(C) } \frac{30b}{t}\qquad \textbf {(D) } \frac{10t}{b} \qquad \textbf {(E) } \frac{10b}{t}$

Answer the following questions: (1) Let $a$ be positive real number. Find $\lim_{n\to\infty} (1+a^{n})^{\frac{1}{n}}.$ (2) Evaluate $\int_1^{\sqrt{3}} \frac{1}{x^2}\ln \sqrt{1+x^2}dx.$ 35 points

Let $E$ denote the set of all natural numbers $n$ such that $3 < n < 100$ and the set $\{ 1, 2, 3, \ldots , n\}$ can be partitioned in to $3$ subsets with equal sums. Find the number of elements of $E$.

Four coins are laid out on a table so that they form the corners of a square. One move consists of tipping one of the coins by letting it jump over one of the others the coin so that it ends up on the directly opposite side of the other coin, the same distance from as it was before the move was made. Is it possible to make a number of moves so that the coins ends up in the corners of a square with a different side length than the original square?

How many positive integer solutions are there to $w+x+y+z=20$ where $w+x\ge 5$ and $y+z\ge 5$?

Show that infinitely many positive integers cannot be written as a sum of three fourth powers of integers.

The mean of three numbers is 10 more than the least of the numbers and 15 less than the greatest. The median of the three numbers is 5. What is their sum? $ \textbf{(A)} \ 5 \qquad \textbf{(B)} \ 20 \qquad \textbf{(C)} \ 25 \qquad \textbf{(D)} \ 30 \qquad \textbf{(E)} \ 36$

Find the maximum value of $ x_{0}$ for which there exists a sequence $ x_{0},x_{1}\cdots ,x_{1995}$ of positive reals with $ x_{0} \equal{} x_{1995}$, such that \[ x_{i \minus{} 1} \plus{} \frac {2}{x_{i \minus{} 1}} \equal{} 2x_{i} \plus{} \frac {1}{x_{i}}, \] for all $ i \equal{} 1,\cdots ,1995$.

Find all polynomials $P$ with real coefficients satisfying $P(x^2)=P(x)\cdot P(x+2)$ for all real numbers $x.$

A square with side length $3$ is inscribed in an isosceles triangle with one side of the square along the base of the triangle. A square with side length $2$ has two vertices on the other square and the other two on sides of the triangle, as shown. What is the area of the triangle? [asy] //diagram by kante314 draw((0,0)--(8,0)--(4,8)--cycle, linewidth(1.5)); draw((2,0)--(2,4)--(6,4)--(6,0)--cycle, linewidth(1.5)); draw((3,4)--(3,6)--(5,6)--(5,4)--cycle, linewidth(1.5)); [/asy] $(\textbf{A})\: 19\frac14\qquad(\textbf{B}) \: 20\frac14\qquad(\textbf{C}) \: 21 \frac34\qquad(\textbf{D}) \: 22\frac12\qquad(\textbf{E}) \: 23\frac34$

Let $n> 2$ be a natural. Given $2n$ points in the plane, no $3$ are collinear. What is the maximum number of lines that can be drawn between them, without forming a triangle? [hide=original wording]Sea n > 2 un natural. Dados 2n puntos en el plano, tres a tres no colineales, Cual es el numero maximo de trazos que pueden dibujarse entre ellos, sin formar un triangulo?[/hide]

Find all functions $f:\mathbb R \to \mathbb R$ such that \[ xf(xf(y)+yf(x))= x^2f(y)+yf(x)^2, \] for all real numbers $x,y$. [i]Proposed by B.J. Venkatachala[/i]

Let $x \geq y \geq z$ be real numbers such that $xy + yz + zx = 1$. Prove that $xz < \frac 12.$ Is it possible to improve the value of constant $\frac 12 \ ?$

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

Pick $x, y, z$ to be real numbers satisfying $(-x+y+z)^2-\frac13 = 4(y-z)^2$, $(x-y+z)^2-\frac14 = 4(z-x)2$, and $(x+y-z)^2 -\frac15 = 4(x-y)^2$. If the value of $xy+yz +zx$ can be written as $\frac{p}{q}$ for relatively prime positive integers $p, q$, find $p + q$.

Let $\omega$ be the circumcircle of isosceles triangle $ABC$ ($AB=AC$). Points $P$ and $Q$ lie on $\omega$ and $BC$ respectively such that $AP=AQ$ .$AP$ and $BC$ intersect at $R$. Prove that the tangents from $B$ and $C$ to the incircle of $\triangle AQR$ (different from $BC$) are concurrent on $\omega$. [i]Proposed by Ali Zamani, Hooman Fattahi[/i]

Geri plays chess against himself. White has a 5% chance of winning, Black has a 5% chance of winning, and there is a 90% chance of a draw. What is the expected number of games Geri will have to play against himself for one of the colors to win four times? [i]Proposed by Matthew Weiss

For a given positive integer $k$ find, in terms of $k$, the minimum value of $N$ for which there is a set of $2k + 1$ distinct positive integers that has sum greater than $N$ but every subset of size $k$ has sum at most $\tfrac{N}{2}.$

Let $p, q, r, s, t \in \mathbb{R}^{*}_{+}$ satisfying: i) $p^2 + pq + q^2 = s^2$ ii) $q^2 + qr + r^2 = t^2$ iii) $r^2 + rp + p^2 = s^2 - st + t^2$ Prove that \[\frac{s^2 - st + t^2}{s^2t^2} = \frac{r^2}{q^2t^2} + \frac{p^2}{q^2s^2} - \frac{pr}{q^2ts}\]

The maximum value of \[ 2\sum_{n=1}^{\infty} \frac{\sin(n\theta)}{44^n} \] over all real numbers $\theta$ can be expressed as a common fraction $\tfrac{p}{q}$. Compute $p + q$.

The incenter of triangle $ABC$ is $ I$. the circumcircle of $ABC$ is tangent to $BC$, $CA$, $AB$ at $T, E, F$. $R$ is a point on $BC$ . Let the $C$-excenter of $\vartriangle CER$ be $L$. Prove that points $L,T,F$ are collinear if and only if $B,E,A,R$ are concyclic. [i]proposed by kyou46[/i]

Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$, define an [i]$A$-inversion[/i] of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds: [list] [*]$a_i \ge w_i > w_j$ [*]$w_j > a_i \ge w_i$, or [*]$w_i > w_j > a_i$. [/list] Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$, and for any positive integer $k$, the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$-inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$-inversions.

The tangent lines to the circumcircle of triangle ABC passing through vertices $B$ and $C$ intersect at point $F$. Points $M$, $L$ and $N$ are the feet of the perpendiculars from vertex $A$ to the lines $FB$, $FC$ and $BC$ respectively. Show that $AM+AL \geq 2AN$

In the quadrilateral $ABCD$ the angles $B{}$ and $D{}$ are straight. The lines $AB{}$ and $DC{}$ intersect at $E$ and the lines $AD$ and $BC$ intersect at $F{}.$ The line passing through $B{}$ parallel to $C{}$D intersects the circumscribed circle $\omega$ of $ABF{}$ at $K{}$ and the segment $KE{}$ intersects $\omega$ at $P{}.$ Prove that the line $AP$ divides the segment $CE$ in half.