Call a positive integer $N$ a $\textit{7-10 double}$ if the digits of the base-7 representation of $N$ form a base-10 number that is twice $N.$ For example, 51 is a 7-10 double because its base-7 representation is 102. What is the largest 7-10 double?

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all real numbers $a$ for which there exists a function $f :\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $3(f(x))^{2}=2f(f(x))+ax^{4}$, for all $x \in \mathbb{R}^{+}$.

A haunted house has six windows. In how many ways can Georgie the Ghost enter the house by one window and leave by a different window? $\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 15 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 36$

A quadrilateral ABCD is inscribed into a circle ω with center O. The circumcircle of the triangle AOC intersects the lines AB, BC, CD and DA the second time at the points M, N, K and L respectively. Prove that the lines MN, KL and the tangents to ω at the points A и C all touch the same circle.

In the isosceles triangle $ABC$, with $AB=AC$, the angle bisector of $\angle B$ meets the side $AC$ at $B'$. Suppose that $BB'+B'A=BC$. Find the angles of the triangle $ABC$. [i]Dan Nedeianu[/i]

Find all the natural numbers $m,n$ such that $1+5 \cdot 2^m=n^2$.

Let $a_{1}$, $a_{2}$, …, $a_{6}$; $b_{1}$, $b_{2}$, …, $b_{6}$ and $c_{1}$, $c_{2}$, …, $c_{6}$ are all permutations of $1$, $2$, …, $6$, respectively. Find the minimum value of $\sum_{i=1}^{6}a_{i}b_{i}c_{i}$.

Let $I$ be the incentre of acute triangle $ABC$ with $AB\neq AC$. The incircle $\omega$ of $ABC$ is tangent to sides $BC, CA$, and $AB$ at $D, E,$ and $F$, respectively. The line through $D$ perpendicular to $EF$ meets $\omega$ at $R$. Line $AR$ meets $\omega$ again at $P$. The circumcircles of triangle $PCE$ and $PBF$ meet again at $Q$. Prove that lines $DI$ and $PQ$ meet on the line through $A$ perpendicular to $AI$. [i]Proposed by Anant Mudgal, India[/i]

Consider the square $ABCD$ and $E \in (AB)$. The diagonal $AC$ intersects the segment $[DE]$ at point $P$. The perpendicular taken from point $P$ on $DE$ intersects the side $BC$ at point $F$. Prove that $EF = AE + FC$.

Let $f(n)$ be the product of all factors of $n$. Find all natural numbers $n$ such that $f(n)$ is not a perfect power of $n$.

The polynomial $f(x)=x^{2007}+17x^{2006}+1$ has distinct zeroes $r_1,\ldots,r_{2007}$. A polynomial $P$ of degree $2007$ has the property that $P\left(r_j+\dfrac{1}{r_j}\right)=0$ for $j=1,\ldots,2007$. Determine the value of $P(1)/P(-1)$.

If there is only $1$ complex solution to the equation $8x^3 + 12x^2 + kx + 1 = 0$, what is $k$?

The Bank of Oslo issues two types of coin: aluminum (denoted A) and bronze (denoted B). Marianne has $n$ aluminum coins and $n$ bronze coins arranged in a row in some arbitrary initial order. A chain is any subsequence of consecutive coins of the same type. Given a fixed positive integer $k \leq 2n$, Gilberty repeatedly performs the following operation: he identifies the longest chain containing the $k^{th}$ coin from the left and moves all coins in that chain to the left end of the row. For example, if $n=4$ and $k=4$, the process starting from the ordering $AABBBABA$ would be $AABBBABA \to BBBAAABA \to AAABBBBA \to BBBBAAAA \to ...$ Find all pairs $(n,k)$ with $1 \leq k \leq 2n$ such that for every initial ordering, at some moment during the process, the leftmost $n$ coins will all be of the same type.

i thought that this problem was in mathlinks but when i searched i didn't find it.so here it is: Find all positive integers m for which for all $\alpha,\beta \in \mathbb{Z}-\{0\}$ \[ \frac{2^m \alpha^m-(\alpha+\beta)^m-(\alpha-\beta)^m}{3 \alpha^2+\beta^2} \in \mathbb{Z} \]

In an $m\times n$ rectangular chessboard,there is a stone in the lower leftmost square. Two persons A,B move the stone alternately. In each step one can move the stone upward or rightward any number of squares. The one who moves it into the upper rightmost square wins. Find all $(m,n)$ such that the first person has a winning strategy.

Let us call a polynomial [i]admissible[/i] if all it's coefficients are $0, 1, 2$ or $3$. For given $n$ find the number of all the [i]admissible [/i] polynomials $P$ such, that $P(2) = n$.

Find the largest $n$ for which there exists a sequence $(a_0, a_1, \ldots, a_n)$ of non-zero digits such that, for each $k$, $1 \le k \le n$, the $k$-digit number $\overline{a_{k-1} a_{k-2} \ldots a_0} = a_{k-1} 10^{k-1} + a_{k-2} 10^{k-2} + \cdots + a_0$ divides the $(k+1)$-digit number $\overline{a_{k} a_{k-1}a_{k-2} \ldots a_0}$. P.S.: This is basically the same problem as http://www.artofproblemsolving.com/Forum/viewtopic.php?f=57&t=548550.

Let $ABC$ be a triangle such that $AB = AC$. Let $D$ be a point in $[BC]$ and $E$ a point in $[AD]$ such that $\angle BE D = \angle BAC = 2 \angle DEC$. Shows that $DB = 2CD$. [img]https://cdn.artofproblemsolving.com/attachments/d/5/677e19d8e68a89134e17a4ab6051e41f283486.png[/img]

For a given integer $n\ge 2$, let $a_0,a_1,\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\{ a_i+a_j \mid 0\le i \le j \le n \}$.

Let $a,b,c,d$ be positive irrational numbers with $a+b = 1$. Show that $c+d = 1$ if and only if $[na]+[nb] = [nc]+[nd]$ for all positive integers $n$.

Kolya and Vasya each have $8$ cards with numbers from $1$ to $8$ (each has all the numbers from $1$ to $8$). Kolya put $4$ cards on the table, and Vasya put a card with a larger number on each of them. Now Vasya puts his remaining $4$ cards on the table. a) Can Kolya always put his own card with a larger number on each of Vasya’s cards? b) Can Kolya always put on each of Vasya’s cards his own card with a number no less than on Vasya’s card?

Suppose that $a,b,c$ are complex numbers with $a+b+c = 0$, $|abc| = 1$, $|b| = |c|$, and $$\frac{9-\sqrt{33}}{48} \le \cos^2 \left( arg \left( \frac{b}{a} \right) \right)\le \frac{9+\sqrt{33}}{48} .$$ Find the maximum possible value of $|-a^6+b^6+c^6|$.

Find all integer solutions of the equation \[\left\lfloor \frac{x}{1!}\right\rfloor+\left\lfloor \frac{x}{2!}\right\rfloor+\cdots+\left\lfloor \frac{x}{10!}\right\rfloor =1001.\]

Tram ticket costs $1$ Tug ($=100$ tugriks). $20$ passengers have only coins in denominations of $2$ and $5$ tugriks, while the conductor has nothing at all. It turned out that all passengers were able to pay the fare and get change. What is the smallest total number of passengers that the tram could have?

Let $\Gamma$ is a circle with diameter $AB$. Let $\ell$ be the tangent of $\Gamma$ at $A$, and $m$ be the tangent of $\Gamma$ through $B$. Let $C$ be a point on $\ell$, $C \ne A$, and let $q_1$ and $q_2$ be two lines that passes through $C$. If $q_i$ cuts $\Gamma$ at $D_i$ and $E_i$ ($D_i$ is located between $C$ and $E_i$) for $i = 1, 2$. The lines $AD_1, AD_2, AE_1, AE_2$ intersects $m$ at $M_1, M_2, N_1, N_2$ respectively. Prove that $M_1M_2 = N_1N_2$.