Found problems: 85335
Let $n$ be a positive integer and $p > n+1$ a prime.
Prove that $p$ divides the following sum $S = 1^n + 2^n +...+ (p - 1)^n$
A finite sequence of integers $a_{0}, a_{1}, \cdots, a_{n}$ is called quadratic if for each $i \in \{1,2,\cdots,n \}$ we have the equality $\vert a_{i}-a_{i-1} \vert = i^2$. [list=a] [*] Prove that for any two integers $b$ and $c$, there exists a natural number $n$ and a quadratic sequence with $a_{0}=b$ and $a_{n}=c$. [*] Find the smallest natural number $n$ for which there exists a quadratic sequence with $a_{0}=0$ and $a_{n}=1996$. [/list]
The polynomial $R(x)$ is the remainder upon dividing $x^{2007}$ by $x^2-5x+6$. $R(0)$ can be expressed as $ab(a^c-b^c)$. Find $a+c-b$.
Show that for each natural number $n$, there exist $n$ distinct natural numbers whose sum is a square and whose product is a cube.
Find all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying the equation \[
f(x^2+y^2+2f(xy)) = (f(x+y))^2.
\] for all $x,y \in \mathbb{R}$.
In a country with $n$ cities, some pairs of cities are connected by one-way flights operated by one of two companies $A$ and $B$. Two cities can be connected by more than one flight in either direction. An $AB$-word $w$ is called implementable if there is a sequence of connected flights whose companies’ names form the word $w$. Given that every $AB$-word of length $ 2^n $ is implementable, prove that every finite $AB$-word is implementable. (An $AB$-word of length $k$ is an arbitrary sequence of $k$ letters $A $ or $B$; e.g. $ AABA $ is a word of length $4$.)
Let $AA_1, BB_1, CC_1$ be the altitudes of an acute-angled triangle $ABC$; $I_a$ be its excenter corresponding to $A$; $I_a'$ be the reflection of $I_a$ about the line $AA_1$. Points $I_b', I_c'$ are defined similarily. Prove that lines $A_1I_a', B_1I_b', C_1I_c'$ concur.
Let $d(n)$ be the number of all positive divisors of a natural number $n \ge 2$.
Determine all natural numbers $n \ge 3$ such that $d(n -1) + d(n) + d(n + 1) \le 8$.
[i]Proposed by Richard Henner[/i]
A circle of radius $r$ passes through both foci of, and exactly four points on, the ellipse with equation $x^2+16y^2=16$. The set of all possible values of $r$ is an interval $[a,b)$. What is $a+b$?
$\textbf{(A) }5\sqrt2+4\qquad\textbf{(B) }\sqrt{17}+7\qquad\textbf{(C) }6\sqrt2+3\qquad\textbf{(D) }\sqrt{15}+8\qquad\textbf{(E) }12$
From vertex $A$ of an equilateral triangle $ABC$, a ray $Ax$ intersects $BC$ at point $D$. Let $E$ be a point on $Ax$ such that $BA =BE$. Calculate $\angle AEC$.
Let an acute triangle $ ABC$ with curcumcircle $ (O)$. Call $ A_1,B_1,C_1$ are foots of perpendicular line from $ A,B,C$ to opposite side. $ A_2,B_2,C_2$ are reflect points of $ A_1,B_1,C_1$ over midpoints of $ BC,CA,AB$ respectively. Circle $ (AB_2C_2),(BC_2A_2),(CA_2B_2)$ cut $ (O)$ at $ A_3,B_3,C_3$ respectively.
Prove that: $ A_1A_3,B_1B_3,C_1C_3$ are concurent.
In triangle $ABC$ let $I_a$ be the $A$-excenter. Let $\omega$ be an arbitrary circle that passes through $A,I_a$ and intersects the extensions of sides $AB,AC$ (extended from $B,C$) at $X,Y$ respectively. Let $S,T$ be points on segments $I_aB,I_aC$ respectively such that $\angle AXI_a=\angle BTI_a$ and $\angle AYI_a=\angle CSI_a$.Lines $BT,CS$ intersect at $K$. Lines $KI_a,TS$ intersect at $Z$.
Prove that $X,Y,Z$ are collinear.
[i]Proposed by Hooman Fattahi[/i]
An $8 \times 8$ board is divided into unit squares. Ten of these squares have their centers marked. Prove that either there exist two marked points on the distance at most $\sqrt2$, or there is a point on the distance $1/2$ from the edge of the board.
It is given a graph whose vertices are positive integers and an edge between numbers $a$ and $b$ exists if and only if
$a + b + 1 | a^2 + b^2 + 1$. Is this graph connected?
Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$, $B(0,12)$, $C(16,0)$, $A'(24,18)$, $B'(36,18)$, and $C'(24,2)$. A rotation of $m$ degrees clockwise around the point $(x,y)$, where $0<m<180$, will transform $\triangle ABC$ to $\triangle A'B'C'$. Find $m+x+y$.
The map of a country is in the form of a convex polygon with $n (n\geq5)$ sides, such as any 3 diagonals do not concur inside the polygon. Some of the diagonals are roads, which allow movement in both directions and the other diagonals are not roads. There are cities on the intersection points of any two diagonals inside the polygon and at least one of the two diagonals is a road. Prove that you can move from any city to any other city using at most 3 roads.
On a circle there're $1000$ marked points, each colored in one of $k$ colors. It's known that among any $5$ pairwise intersecting segments, endpoints of which are $10$ distinct marked points, there're at least $3$ segments, each of which has its endpoints colored in different colors. Determine the smallest possible value of $k$ for which it's possible.
Kelvin the Frog likes numbers whose digits strictly decrease, but numbers that violate this condition in at most one place are good enough. In other words, if $d_i$ denotes the $i$th digit, then $d_i\le d_{i+1}$ for at most one value of $i$. For example, Kelvin likes the numbers $43210$, $132$, and $3$, but not the numbers $1337$ and $123$. How many $5$-digit numbers does Kelvin like?
Given a prime $p$ in the form $4m+1$ ($m\in\mathbb{Z}$). Prove that the number $216p^3$ can't be represented in the form $x^2+y^2+z^9$, $x,y,z\in\mathbb{Z}$
Let $x_i$, $y_i$, $z_i$, $w_i \in \mathbb{R}^+, i = 1, 2,\cdots n$, such that$$\sum \limits_{i=1}^nx_i=nx,\ \sum \limits_{i=1}^ny_i=ny,\ \sum \limits_{i=1}^nw_i=nw $$ $$\Gamma \left(z_i\right)\geq \Gamma \left(w_i\right),\ \sum \limits_{i=1}^n\Gamma \left(z_i\right)=n\Gamma^* (z)$$Then$$\sum \limits_{i=1}^n \frac{\left(\Gamma \left(x_i\right)+\Gamma \left(y_i\right)\right)^2}{\Gamma \left(z_i\right)-\Gamma \left(w_i\right)}\geq n\frac{\left(\Gamma \left(x\right)+\Gamma \left(y\right)\right)^2}{\Gamma^* \left(z\right)-\Gamma \left(w\right)}$$
The function $f:\mathbb{R} \to \mathbb{R}$ is such that $f(f(x+1)) = x^3+1$ for all real numbers $x$. Prove that the equation $f(x) = 0 $ has exactly one real root.
The fraction $ \frac{\sqrt{a^2\plus{}x^2}\minus{}(x^2\minus{}a^2)/\sqrt{a^2\plus{}x^2}}{a^2\plus{}x^2}$ reduces to:
$ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ \frac{2a^2}{a^2\plus{}x^2} \qquad\textbf{(C)}\ \frac{2x^2}{(a^2\plus{}x^2)^{\frac{3}{2}}} \qquad\textbf{(D)}\ \frac{2a^2}{(a^2\plus{}x^2)^{\frac{3}{2}}} \qquad\textbf{(E)}\ \frac{2x^2}{a^2\plus{}x^2}$
Let $n$ be the number that is produced by concatenating the numbers $1, 2,... , 4022$,
that is, $n = 1234567891011...40214022$.
a. Show that $n$ is divisible by $3$.
b. Let $a_1 = n^{2011}$, and let $a_i$ be the sum of the digits of $a_{i-1}$ for $i > 1$. Find $a_4$
Let $n$ be a positive integer. Prove that for every odd prime $p$ dividing $n^2 + n + 2$, there exist integers $a, b$ such that $p = a^2 + 7b^2$.
Two runners start running along a circular track of unit length from the same starting point and int he same sense, with constant speeds $v_1$ and $v_2$ respectively, where $v_1$ and $v_2$ are two distinct relatively prime natural numbers. They continue running till they simultneously reach the starting point. Prove that
(a) at any given time $t$, at least one of the runners is at a distance not more than $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units from the starting point.
(b) there is a time $t$ such that both the runners are at least $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units away from the starting point. (All disstances are measured along the track). $[x]$ is the greatest integer function.