Find a four-digit number whose division by two given distinct one-digit numbers goes along the following lines: [img]https://cdn.artofproblemsolving.com/attachments/2/a/e1d3c68ec52e11ad59de755c3dbdc2cf54a81f.png[/img]

The Fibonacci sequence is given by $a_1 = 1, a_2 = 2$ and $a_{n+1} = a_n +a_{n-1}$ for $n > 1$. Express $a_{2n}$ in terms of only $a_{n-1},a_n,a_{n+1}$.

Suppose $F$ is a polygon with lattice vertices and sides parralell to x-axis and y-axis.Suppose $S(F),P(F)$ are area and perimeter of $F$. Find the smallest k that: $S(F) \leq k.P(F)^2$

Let $a,b,c>0$ and $abc\ge1.$ Prove that $a^4+b^3+c^2\ge a^3+b^2+c.$

(a) Can it happen that in a group of $10$ girls and $9$ boys, ball the girls know a different number of boys while all the boys know the same number of girls? (b) What if there are $11$ girls and $10$ boys? (NB Vassiliev)

Let $a, b, c ,d$ be real numbers greater than $1$ and $x, y$ be real numbers such that \[ a^x+b^y = (a^2+b^2)^x \quad \text{and} \quad c^x+d^y = 2^y(cd)^{y/2} \] Prove that $x<y$.

A finite set $\mathcal{L}$ of coplanar lines, no three of which are concurrent, is called [i]odd[/i] if, for every line $\ell$ in $\mathcal{L}$ the total number of lines in $\mathcal{L}$ crossed by $\ell$ is odd. [list=a] [*]Prove that every finite set of coplanar lines, no three of which are concurrent, extends to an odd set of coplanar lines. [*]Given a positive integer $n$ determine the smallest nonnegative integer $k$ satisfying the following condition: Every set of $n$ coplanar lines, no three of which are concurrent, extends to an odd set of $n+k$ coplanar lines. [/list]

Find the sum of all the digits in the decimal representations of all the positive integers less than $1000.$

For natural number $n$ we define \[ a_n = \{ \sqrt{n} \} - \{ \sqrt{n + 1} \} + \{ \sqrt{n + 2} \} - \{ \sqrt{n + 3} \}. \] a) Show that $a_1 > 0,2$. b) Show that $a_n < 0$ for infinity many values of $n$ and $a_n > 0$ for infinity values of natural numbers of $n$ as well. ( We denote by $\{ x \} $ the fractional part of $x.$)

Set $M=\{z\in\mathbb{C}|(z-1)^2=|z-1|^2\}$, then $\text{(A)}M=\{\text{pure imaginary number}\}$ $\text{(B)}M=\{\text{real number}\}$ $\text{(C)}M=\{\text{real number}\}\subset M\subset\{\text{complex number}\}$ $\text{(D)}M=\{\text{complex number}\}$

Given are the odd integers $m> 1$, $k$, and a prime $p$ such that $p> mk +1$. Prove that $p^{2}\mid {\binom{k}{k}}^{m}+{\binom{k+1}{k}}^{m}+\cdots+{\binom{p-1}{k}}^{m}$.

$f: (0,1) \rightarrow [0, \infty)$ is zero except at a countable set of points $a_{1}, a_2, a_3, ... $ . Let $b_n = f(a_n)$. Show that if $\sum b_{n}$ converges, then $f$ is differentiable at at least one point. Show that for any sequence $b_{n}$ of non-negative reals with $\sum b_{n} =\infty$ , we can find a sequence $a_{n}$ such that the function $f$ defined as above is nowhere differentiable.

How many (nondegenerate) tetrahedrons can be formed from the vertices of an $n$-dimensional hypercube?

Isosceles triangles $A_3A_1O_2$ and $A_1A_2O_3$ are constructed on the sides of a triangle $A_1A_2A_3$ as the bases, outside the triangle. Let $O_1$ be a point outside $\Delta A_1A_2A_3$ such that $\angle O_1A_3A_2 =\frac 12\angle A_1O_3A_2$ and $\angle O_1A_2A_3 =\frac 12\angle A_1O_2A_3$. Prove that $A_1O_1\perp O_2O_3$, and if $T$ is the projection of $O_1$ onto $A_2A_3$, then $\frac{A_1O_1}{O_2O_3} = 2\frac{O_1T}{A_2A_3}$.

What is the maximum distance between the particle and the origin? (A) $\text{2.00 m}$ (B) $\text{2.50 m}$ (C) $\text{3.50 m}$ (D) $\text{5.00 m}$ (E) $\text{7.00 m}$

There are $68$ coins , each coin having a different weight than that of each other . Show how to find the heaviest and lightest coin in $100$ weighings on a balance beam. (S. Fomin, Leningrad)

Let $\triangle ABC$ be an arbitary triangle, and construct $P,Q,R$ so that each of the angles marked is $30^\circ$. Prove that $\triangle PQR$ is an equilateral triangle. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair ext30(pair pt1, pair pt2) { pair r1 = pt1+rotate(-30)*(pt2-pt1), r2 = pt2+rotate(30)*(pt1-pt2); draw(anglemark(r1,pt1,pt2,25)); draw(anglemark(pt1,pt2,r2,25)); return intersectionpoints(pt1--r1, pt2--r2)[0]; } pair A = (0,0), B=(10,0), C=(3,7), P=ext30(B,C), Q=ext30(C,A), R=ext30(A,B); draw(A--B--C--A--R--B--P--C--Q--A); draw(P--Q--R--cycle, linetype("8 8")); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, N); label("$P$", P, NE); label("$Q$", Q, NW); label("$R$", R, S);[/asy]

3. Six points A, B, C, D, E, F are connected with segments length of $1$. Each segment is painted red or black probability of $\frac{1}{2}$ independence. When point A to Point E exist through segments painted red, let $X$ be. Let $X=0$ be non-exist it. Then, for $n=0,2,4$, find the probability of $X=n$.

Let $ABC$ be an acute triangle with incircle $\omega$, incenter $I$, and $A$-excircle $\omega_{a}$. Let $\omega$ and $\omega_{a}$ meet $BC$ at $X$ and $Y$, respectively. Let $Z$ be the intersection point of $AY$ and $\omega$ which is closer to $A$. The point $H$ is the foot of the altitude from $A$. Show that $HZ$, $IY$ and $AX$ are concurrent. [i]Proposed by Nikola Velov[/i]

Given that $5r+4s+3t+6u =100$, where $r\ge s\ge t\ge u\ge 0.$ are real numbers, find, with proof, the maximum and minimum possible values of $r+s+t+u$.

Joe finally asked Kathryn out. They go out on a date on a Friday night, racing at the local go-kart track. They take turns racing across an $8 \times 8$ square grid composed of $64$ unit squares. If Joe and Kathryn start in the lower left-hand corner of the $8\times 8$ square, and can move either up or right along any side of any unit square, what is the probability that Joe and Kathryn take the same exact path to reach the upper right-hand corner of the $8\times 8$ square grid?

Define $\phi^!(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the remainder when \[ \sum_{\substack{2 \le n \le 50 \\ \gcd(n,50)=1}} \phi^!(n) \] is divided by $50$.

The positive integers $ \alpha, \beta, \gamma$ are the roots of a polynomial $ f(x)$ with degree $ 4$ and the coefficient of the first term is $ 1$. If there exists an integer such that $ f(\minus{}1)\equal{}f^2(s)$. Prove that $ \alpha\beta$ is not a perfect square.

Let $n > 2$ be an integer and let $m = \sum k^3$, where the sum is taken over all integers $k$ with $1 \leq k < n$ that are relatively prime to $n$. Prove that $n$ divides $m$.

Cut the $10$ cm $x 20$ cm rectangle into two pieces with one straight cut so that they can be placed inside the $19.4$ cm diameter circle without intersecting.