This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\] Proposed by Moldova
Let $a, b$ be two nonnegative real numbers and $n$ a positive integer. Prove that \[\left(1-2^{-n}\right)\left|a^{2^n}-b^{2^n}\right|\ge\sqrt{ab}\left|a^{2^n-1}-b^{2^n-1}\right|.\]
Find all functions satisfying the equality $$(x-1)f \left(\dfrac{x+1}{x-1}\right)- f(x) = x$$ for all $x \ne 1$.
[b]p1.[/b] It takes $12$ months for Santa Claus to pack gifts. It would take $20$ months for his apprentice to do the job. If they work together, how long will it take for them to pack the gifts? [b]p2.[/b] All passengers on a bus sit in pairs. Exactly $2/5$ of all men sit with women, exactly $2/3$ of all women sit with men. What part of passengers are men? [b]p3.[/b] There are $100$ colored balls in a box. Every $10$-tuple of balls contains at least two balls of the same color. Show that there are at least $12$ balls of the same color in the box. [b]p4.[/b] There are $81$ wheels in storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that one can determine which wheel is incorrectly marked with four measurements. [b]p5.[/b] Remove from the figure below the specified number of matches so that there are exactly $5$ squares of equal size left: (a) $8$ matches (b) $4$ matches [img]https://cdn.artofproblemsolving.com/attachments/4/b/0c5a65f2d9b72fbea50df12e328c024a0c7884.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $f(n) = n + \lfloor \sqrt{n} \rfloor$. Prove that for every positive integer $m$, the integer sequence $m, f(m), f(f(m)), \dots$ contains at least one square of an integer.
Let $ a, b, c$ be positive real numbers such that $ bc +ca +b = 1,$ . Prove that $$ \frac {1 +b^2c^2}{(b +c)^2} + \frac {1+ c^2a^2}{(c + a)^2} +\frac {1 +a^2b^2}{(a +b)^2} \geq \frac {5}{2}.$$
Let $a,b,c>0$ and $abc\ge1.$ Prove that a) $\left(a+\frac{1}{a+1}\right)\left(b+\frac{1}{b+1}\right) \left(c+\frac{1}{c+1}\right)\ge\frac{27}{8}.$ b)$27(a^{3}+a^{2}+a+1)(b^{3}+b^{2}+b+1)(c^{3}+c^{2}+c+1)\ge$ $\ge 64(a^{2}+a+1)(b^{2}+b+1)(c^{2}+c+1).$ [hide="Generalization"]$n^{3}(a^{n}+\ldots+a+1)(b^{n}+\ldots+b+1)(c^{n}+\ldots+c+1)\ge$ $\ge (n+1)^{3}(a^{n-1}+\ldots+a+1)(b^{n-1}+\ldots+b+1)(c^{n-1}+\ldots+c+1),\ n\ge1.$ [/hide]
Let $\psi (n)$ be the number of integers $0 \le r < n$ such that there exists an integer $x$ that satis es $x^2 + x \equiv r$ (mod $n$). Find the sum of all distinct prime factors of $$\sum^4_{i=0}\sum^4_{j=0} \psi(3^i5^j).$$
Triangle $LMT$ has $\overline{MA}$ as an altitude. Given that $MA = 16$, $MT = 20$, and $LT = 25$, find the length of the altitude from $L$ to $\overline{MT}$. [i]Proposed by Kevin Zhao[/i]
On a social network, no user has more than ten friends ( the state "friendship" is symmetrical). The network is connected: if, upon learning interesting news a user starts sending it to its friends, and these friends to their own friends and so on, then at the end, all users hear about the news. Prove that the network administration can divide users into groups so that the following conditions are met: [list] [*] each user is in exactly one group [*] each group is connected in the above sense [*] one of the groups contains from $1$ to $100$ members and the remaining from $100$ to $900$. [/list]
Determine all pairs of integer numbers $(a, b)$ that satisfy the relation: $$(a + b)(a + b + 6) = 34 \cdot 3^{|2a-b|}- 7$$
Determine all non empty sets $C_1, C_2, C_3, \cdots $ such that each one of them has a finite number of elements, all their elements are positive integers, and they satisfy the following property: For any positive integers $n$ and $m$, the number of elements in the set $C_n$ plus the number of elements in the set $C_m$ equals the sum of the elements in the set $C_{m + n}$. [i]Note:[/i] We denote $\lvert C_n \lvert$ the number of elements in the set $C_n$, and $S_k$ as the sum of the elements in the set $C_n$ so the problem's condition is that for every $n$ and $m$: \[\lvert C_n \lvert + \lvert C_m \lvert = S_{n + m}\] is satisfied.
There are $15$ boys and $15$ girls in the class. The first girl is friends with $4$ boys, the second with $5$, the third with $6$, . . . , the $11$th with $14$, and each of the other four girls is friends with all the boys. It turned out that there are exactly $3 \cdot 2^{25}$ ways to split the entire class into pairs, so that each pair has a boy and a girl who are friends. Prove that any of the friends of the first girl are friends with all the other girls too. [i]G.M.Sharafetdinova[/i]
Let $n$ to be a positive integer. A family $\wp$ of intervals $[i, j]$ with $0 \le i < j \le n$ and $i$, $j$ integers is considered [i]happy[/i] if, for any $I_1 = [i_1, j_1] \in \wp$ and $I_2 = [i_2, j_2] \in \wp$ such that $I_1 \subset I_2$, we have $i_1 = i_2$ [b]or[/b] $j_1 = j_2$. Determine the maximum number of elements of a [i]happy[/i] family.
Let $N \geqslant 3$ be an integer. In the country of Sibyl, there are $N^2$ towns arranged as the vertices of an $N \times N$ grid, with each pair of towns corresponding to an adjacent pair of vertices on the grid connected by a road. Several automated drones are given the instruction to traverse a rectangular path starting and ending at the same town, following the roads of the country. It turned out that each road was traversed at least once by some drone. Determine the minimum number of drones that must be operating. [i]Proposed by Sutanay Bhattacharya and Anant Mudgal[/i]
Each of Mahdi and Morteza has drawn an inscribed $93$-gon. Denote the first one by $A_1A_2…A_{93}$ and the second by $B_1B_2…B_{93}$. It is known that $A_iA_{i+1} // B_iB_{i+1}$ for $1 \le i \le 93$ ($A_{93} = A_1, B_{93} = B_1$). Show that $\frac{A_iA_{i+1} }{ B_iB_{i+1}}$ is a constant number independent of $i$. by Morteza Saghafian
For how many numbers $n$ does $2017$ divided by $n$ have a remainder of either $1$ or $2$?
Prove that these three statements are equivalent: (a) For every continuous function $f:S^n \to \mathbb R^n$, there exists an $x\in S^n$ such that $f(x)=f(-x)$. (b) There is no antipodal mapping $f:S^n \to S^{n-1}$. (c) For every covering of $S^n$ with closed sets $A_0,\dots,A_n$, there exists an index $i$ such that $A_i\cap -A_i\neq \emptyset$.
Let $P$ be a function defined by $P(t)=a^t+b^t$, where $a$ and $b$ are complex numbers. If $P(1)=7$ and $P(3)=28$, compute $P(2)$. [i] Proposed by Justin Stevens [/i]
Let $a_1,a_2,a_3,a_4,a_5$ be distinct real numbers. Consider all sums of the form $a_i + a_j$ where $i,j \in \{1,2,3,4,5\}$ and $i \neq j$. Let $m$ be the number of distinct numbers among these sums. What is the smallest possible value of $m$?
Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]
Determine all polynomials $P(x)$ with integer coefficients which satisfies $P(n)\mid n!+2$ for all postive integer $n$.
Let a, b, c be natural numbers , so that c> b> a> 0. Show that, among any 2c consecutive natural numbers, there are three distinct numbers x, y, z so abc divides xyz.
Let $ABCD$ be a cyclic quadrilateral. Prove that $AC > BD$ if and only if $(AD-BC)(AB- CD) > 0$. (V. Yasinsky)