Found problems: 85335
Some books are placed on each other. Someone first, reverses the upper book. Then he reverses the $2$ upper books. Then he reverses the $3$ upper books and continues like this. After he reversed all the books, he starts this operation from the first. Prove that after finite number of movements, the books become exactly like their initial configuration.
Let $x, y$ be distinct positive integers. Prove that the number $$\frac{(x+y)^2}{ x^3 + xy^2 - x^2y - y^3}$$ is not an integer
Let the line $L$ be perpendicular to the plane $P$. Three spheres touch each other in pairs so that each sphere touches the plane $P$ and the line $L$. The radius of the larger sphere is $1$. Find the minimum radius of the smallest sphere.
A game is played on a $23\times 23$ board. The first player controls two white chips which start in the bottom left and top right corners. The second player controls two black ones which start in bottom right and top left corners. The players move alternately. In each move, a player moves one of the chips under control to a square which shares a side with the square the chip is currently in. The first player wins if he can bring the white chips to squares which share a side with each other. Can the second player prevent the first player from winning?
Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.
Let $\tfrac{a}{b}$ be a fraction such that $a$ and $b$ are positive integers and the first three digits of its decimal expansion are $527$. What is the smallest possible value of $a+b?$
Calculate: $\underset{n\to \infty }{\mathop{\lim }}\,\int_{0}^{1}{{{e}^{{{x}^{n}}}}dx}$
For each positive integer $k,$ let $A(k)$ be the number of odd divisors of $k$ in the interval $\left[1,\sqrt{2k}\right).$ Evaluate: \[\sum_{k=1}^{\infty}(-1)^{k-1}\frac{A(k)}k.\]
Find the number of ordered triplets $(a,b,c)$ of positive integers such that $abc=2008$ (the product of $a$, $b$, and $c$ is $2008$).
Determine the smallest positive integer $n$ with the following property: on a board $n \times n$, whose squares are painted in checkerboard pattern (that is, for any two squares with a common edge, one of them is black and the other is white), it is possible to place the numbers $1,2,3 , ... , n^2$, a number in each square, so if $B$ is the sum of the numbers written in the white squares and $P$ is the sum of the numbers written in the black squares, then $\frac {B}{P} = \frac{2021}{4321}$.
Establish if we can rewrite the numbers $1,2,3,4,5,6,7,8,9,10$ in a row in such a way that:
(a) The sum of any three consecutive numbers (in the new order) does not exceed $16$.
(b) The sum of any three consecutive numbers (in the new order) does not exceed $15$.
Let $ABC$ be an acute triangle with $\omega,S$, and $R$ being its incircle, circumcircle, and circumradius, respectively. Circle $\omega_{A}$ is tangent internally to $S$ at $A$ and tangent externally to $\omega$. Circle $S_{A}$ is tangent internally to $S$ at $A$ and tangent internally to $\omega$. Let $P_{A}$ and $Q_{A}$ denote the centers of $\omega_{A}$ and $S_{A}$, respectively. Define points $P_{B}, Q_{B}, P_{C}, Q_{C}$ analogously. Prove that
\[8P_{A}Q_{A}\cdot P_{B}Q_{B}\cdot P_{C}Q_{C}\leq R^{3}\; , \]
with equality if and only if triangle $ABC$ is equilateral.
Let $P_1,P_2,\ldots ,P_n$, be infinite arithmetic progressions of positive integers, of differences $d_1,d_2,\ldots ,d_n$, respectively. Prove that if every positive integer appears in at least one of the $n$ progressions then one of the differences $d_i$ divides the least common multiple of the remaining $n-1$ differences.
Note: $P_i=\left \{ a_i,a_i+d_i,a_i+2d_i,a_i+3d_i,a_i+4d_i,\cdots \right \}$ with $ a_i$ and $d_i$ positive integers.
find the smallest integer $n\geq1$ such that the equation :
$$a^2+b^2+c^2-nd^2=0 $$
has $(0,0,0,0)$ as unique solution .
Let $ABCD$ be the cyclic quadrilateral. Suppose that there exists some line $l$ parallel to $BD$ which is tangent to the inscribed circles of triangles $ABC, CDA$. Show that $l$ passes through the incenter of $BCD$ or through the incenter of $DAB$.
[i](Proposed by Fedir Yudin)[/i]
A positive integer \( r \) is given, find the largest real number \( C \) such that there exists a geometric sequence $\{ a_n \}_{n\ge 1}$ with common ratio \( r \) satisfying
$$
\| a_n \| \ge C
$$
for all positive integers \( n \). Here, $\| x \|$ denotes the distance from the real number \( x \) to the nearest integer.
In the $x$-$y$ plane, two variable points $P,\ Q$ stay in $P(2t,\ -2t^2+2t),\ Q(t+2,-3t+2)$ at the time $t$.
Let denote $t_0$ as the time such that $\overline{PQ}=0$. When $t$ varies in the range of $0\leq t\leq t_0$, find the area of the region swept by the line segment $PQ$ in the $x$-$y$ plane.
Let $G$ be a simple graph on the infinite vertex set $V=\{v_1, v_2, v_3,\ldots\}$. Suppose every subgraph of $G$ on a finite vertex subset is $10$-colorable, Prove that $G$ itself is $10$-colorable.
For integers $a,b$ we define $f((a,b))=(2a,b-a)$ if $a<b$ and $f((a,b))=(a-b,2b)$ if $a\geq b$.
Given a natural number $n>1$ show that there exist natural numbers $m,k$ with $m<n$ such that $f^{k}((n,m))=(m,n)$,where
$f^{k}(x)=f(f(f(...f(x))))$,$f$ being composed with itself $k$ times.
Solve in non-negative integers the equation $ 2^{a}3^{b} \plus{} 9 \equal{} c^{2}$
Put $x = \log_{10} 2$, $y = \log_{10} 3$. Then $15 < 16$ implies $1 - x + y < 4x$, so $1 + y < 5x$.
Derive similar inequalities from $80 < 81$ and $243 < 250$. Hence show that \[
0.47 < \log_{10} 3 < 0.482.
\]
Consider a regular pentagon $ABCDE$, and let the intersection of diagonals $\overline{CA}$ and $\overline{EB}$ be $F$. Find $\angle AFB$.
[i]Proposed by Justin Chen[/i]
Navi and Ozna are playing a game where Ozna starts first and the two take turn making moves. A positive integer is written on the waord. A move is to (i) subtract any positive integer at most 2015 from it or (ii) given that the integer on the board is divisible by $2014$, divide by $2014$. The first person to make the integer $0$ wins. To make Navi's condition worse, Ozna gets to pick integers $a$ and $b$, $a\ge 2015$ such that all numbers of the form $an+b$ will not be the starting integer, where $n$ is any positive integer.
Find the minimum number of starting integer where Navi wins.
Let $p$ be an odd prime. An integer $x$ is called a [i]quadratic non-residue[/i] if $p$ does not divide $x-t^2$ for any integer $t$.
Denote by $A$ the set of all integers $a$ such that $1\le a<p$, and both $a$ and $4-a$ are quadratic non-residues. Calculate the remainder when the product of the elements of $A$ is divided by $p$.
[i]Proposed by Richard Stong and Toni Bluher[/i]
Let $n$ be a positive integer. Find all positive integers $m$ for which there exists a polynomial $f(x) = a_{0} + \cdots + a_{n}x^{n} \in \mathbb{Z}[X]$ ($a_{n} \not= 0$) such that $\gcd(a_{0},a_{1},\cdots,a_{n},m)=1$ and $m|f(k)$ for each $k \in \mathbb{Z}$.