Found problems: 85335
The integer $n \geq 1$ does not contain digits: $1,\; 2,\; 9\;$ in its decimal notation. Prove that one of the digits: $1,\; 2,\; 9$ appears at least once in the decimal notation of the number $3n$.
For a prime $ p$ and a given integer $ n$ let $ \nu_p(n)$ denote the exponent of $ p$ in the prime factorisation of $ n!$. Given $ d \in \mathbb{N}$ and $ \{p_1,p_2,\ldots,p_k\}$ a set of $ k$ primes, show that there are infinitely many positive integers $ n$ such that $ d\mid \nu_{p_i}(n)$ for all $ 1 \leq i \leq k$.
[i]Author: Tejaswi Navilarekkallu, India[/i]
Let $ABC$ be a triangle. Let $K, L$ and $M$ be points on the sides $BC, AC$ and $AB$, respectively, such that $\frac{|AM|}{|MB|}\cdot \frac{|BK|}{|KC|}\cdot \frac{|CL|}{|LA|} = 1$. Prove that it is possible to choose two triangles out of $ALM, BMK, CKL$ whose inradii sum up to at least the inradius of triangle $ABC$.
A store prices an item in dollars and cents so that when 4% sales tax is added, no rounding is necessary because the result is exactly $n$ dollars where $n$ is a positive integer. The smallest value of $n$ is
$\text{(A)} \ 1 \qquad \text{(B)} \ 13 \qquad \text{(C)} \ 25 \qquad \text{(D)} \ 26 \qquad \text{(E)} \ 100$
Lily pads $1,2,3,\ldots$ lie in a row on a pond. A frog makes a sequence of jumps starting on pad $1$. From any pad $k$ the frog jumps to either pad $k+1$ or pad $k+2$ chosen randomly and independently with probability $\tfrac12$. The probability that the frog visits pad $7$ is $\tfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
The numbers from 1 to 100 are written in an unknown order. One may ask about any 50 numbers and find out their relative order. What is the fewest questions needed to find the order of all 100 numbers?
[i]S. Tokarev[/i]
Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)
Find the smallest positive integer $m$ satisfying the following condition: for all prime numbers $p$ such that $p>3$,have $105|9^{ p^2}-29^p+m.$
(September 28, 2012, Hohhot)
Let $(x, y)$ be an intersection of the equations $y = 4x^2 - 28x + 41$ and $x^2 + 25y^2 - 7x + 100y +\frac{349}{4}= 0$. Find the sum of all possible values of $x$.
Given integer $n\geq 2$ and real numbers $x_1,x_2,\cdots, x_n$ in the interval $[0,1]$. Prove that there exist real numbers $a_0,a_1,\cdots,a_n$ satisfying the following conditions:
(1) $a_0+a_n=0$;
(2) $|a_i|\leq 1$, for $i=0,1,\cdots,n$;
(3) $|a_i-a_{i-1}|=x_i$, for $i=1,2,\cdots,n$.
Euler marks $n$ different points in the Euclidean plane. For each pair of marked points, Gauss writes down the number $\lfloor \log_2 d \rfloor$ where $d$ is the distance between the two points. Prove that Gauss writes down less than $2n$ distinct values.
[i]Note:[/i] For any $d>0$, $\lfloor \log_2 d\rfloor$ is the unique integer $k$ such that $2^k\le d<2^{k+1}$.
[i]Proposed by Pranjal Srivastava[/i]
The ${\textit{distinct prime factors}}$ of an integer are its prime factors listed without repetition. For example, the distinct prime factors of $40$ are $2$ and $5$.
Let $A=2^k - 2$ and $B= 2^k \cdot A$, where $k$ is an integer ($k \ge 2$).
Show that, for every integer $k$ greater than or equal to $2$,
[list=i]
[*] $A$ and $B$ have the same set of distinct prime factors.
[*] $A+1$ and $B+1$ have the same set of distinct prime factors.
[/list]
Determine all values of parameter $\alpha\in [0,2\pi]$ such that the equation $$(2\cos\alpha-1)x^2+4x+4\cos\alpha+2=0$$ has
1) a positive root $x_1$,
2) if a second root $x_2$ exists and if $x_2\neq x_1$, the $x_2\leq 0$.
Let $x$ and $y$ be real numbers satisfying \[(x^2+x-1)(x^2-x+1)=2(y^3-2\sqrt{5}-1)\] and \[(y^2+y-1)(y^2-y+1)=2(x^3+2\sqrt{5}-1)\] Find $8x^2+4y^3$.
The numbers \( 1, 2, 3, \ldots, 60 \) are written in a row in that exact order. Igor and Ruslan take turns inserting the signs \( +, -, \times \) between them, starting with Igor. Each turn consists of placing one sign. Once all signs are placed, the value of the resulting expression is computed. If the value is divisible by $3$, Igor wins; otherwise, Ruslan wins. Which player has a winning strategy regardless of the opponent’s moves? \\
Determine the smallest positive integer $n$ whose prime factors are all greater than $18$, and that can be expressed as $n = a^3 + b^3$ with positive integers $a$ and $b$.
Given a hexagon $ABCDEF$ such that $AB=BC$, $CD=DE$ , $EF=FA$ and $\angle A = \angle C = \angle E $ Prove that $AD, BE, CF$ are concurrent.
Prove that:
a) the sequence $a_n=\frac{1}{n+1}+\frac{1}{n+2}+\ldots+\frac{1}{n+n},\ n\ge 1$ is monotonic.
b) there is a sequence $(a_n)_{n\ge 1}\in \{0,1\}$ such that:
\[\lim_{n\to \infty} \left(\frac{a_1}{n+1}+\frac{a_2}{n+2}+\ldots +\frac{a_n}{n+n}\right)=\frac{1}{2}\]
[i]Radu Gologan[/i]
A group consists of $n$ tourists. Among every three of them there are at least two that are not familiar. For any partition of the group into two busses, there are at least two familiar tourists in one bus. Prove that there is a tourist who is familiar with at most two fifth of all the tourists.
Show that, for any integer $n$, the number $n^3 - 9n + 27$ is not divisible by $81$.
Let $ ABCD $ be a tetrahedron with $ \angle ABC = \angle ABD = \angle CBD = 90^\circ $ and $ AB = BC $. Let $ E, F, G $ be points on $ \overline{AD} $, $ BD $, and $ \overline{CD} $, respectively, such that each of the quadrilaterals $ AEFB $, $ BFGC $, and $ CGEA $ have an inscribed circle. Let $ r $ be the smallest real number such that $ \dfrac{[\triangle EFG]}{[\triangle ABC]} \leq r $ for all such configurations $ A, B, C, D, E, F, G $. If $ r $ can be expressed as $ \dfrac{\sqrt{a - b\sqrt{c}}}{d} $ where $ a, b, c, d $ are positive integers with $ \gcd(a, b) $ squarefree and $ c $ squarefree, find $ a + b + c + d $.
Note: Here, $ [P] $ denotes the area of polygon $ P $. (This wasn't in the original test; instead they used the notation $ \text{area}(P) $, which is clear but frankly cumbersome. :P)
Let $n$ be an odd positive integer, and let $x_1,x_2,\cdots ,x_n$ be non-negative real numbers. Show that \[ \min_{i=1,\ldots,n} (x_i^2+x_{i+1}^2) \leq \max_{j=1,\ldots,n} (2x_jx_{j+1}) \]where $x_{n+1}=x_1$.
You want to color the side faces of a cube in such a way that each face is colored evenly. Six colors are available:
[i]red, white, blue, yellow, purple, orange[/i]. Two cube colors are called the same if one arises from the other by a rotation of the cube.
(a) How many different cube colorings are there, using six colors?
(b) How many different cube colorings are there, using exactly five colors?
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.
Find all completely multipiclative functions $f:\mathbb{Z}\rightarrow \mathbb{Z}_{\geqslant 0}$ such that for any $a,b\in \mathbb{Z}$ and $b\neq 0$, there exist integers $q,r$ such that
$$a=bq+r$$
and
$$f(r)<f(b)$$
Proposed by Navid Safaei