Found problems: 15925
Kvant 2020, M2594
It is known that for some $x{}$ and $y{}$ the sums $\sin x+ \cos y$ and $\sin y + \cos x$ are positive rational numbers. Prove that there exist natural numbers $m{}$ and $n{}$ such that $m\sin x+n\cos x$ is a natural number.
[i]Proposed by N. Agakhanov[/i]
2012 Mathcenter Contest + Longlist, 1 sl8
For matrices $A=[a_{ij}]_{m \times m}$ and $B=[b_{ij}]_{m \times m}$ where $A,B \in \mathbb{Z} ^{m \times m}$ let $A \equiv B \pmod{n}$ only if $a_{ij} \equiv b_{ij} \pmod{n}$ for every $i,j \in \{ 1,2,...,m \}$, that's $A-B=nZ$ for some $Z \in \mathbb{Z}^{m \times m}$. (The symbol $A \in \mathbb{Z} ^{m \times m}$ means that every element in $A$ is an integer.)
Prove that for $A \in \mathbb{Z} ^{m \times m}$ there is $B \in \mathbb{Z} ^{m \times m}$ , where $AB \equiv I \pmod{n }$ only if $(\det (A),n)=1$ and find the value of $B$ in the form of $A$ where $I$ represents the dimensional identity matrix $m \times m$.
[i](PP-nine)[/i]
1989 Iran MO (2nd round), 2
Let $n$ be a positive integer. Prove that the polynomial
\[P(x)= \frac{x^n}{n!}+\frac{x^{n-1}}{(n-1)!}+...+x+1 \]
Does not have any rational root.
1977 Bundeswettbewerb Mathematik, 1
Among $2000$ distinct positive integers, there are equally many even and odd ones. The sum of the numbers is less than $3000000.$ Show that at least one of the numbers is divisible by $3.$
2022 Malaysia IMONST 2, 3
Prove that
$$1\cdot 4 + 2\cdot 5 + 3\cdot 6 + \cdots + n(n+3) = \frac{n(n+1)(n+5)}{3}$$
for all positive integer $n$.
2020 Kosovo National Mathematical Olympiad, 1
Let $x\in\mathbb{R}$. What is the maximum value of the following expression: $\sqrt{x-2018} + \sqrt{2020-x}$ ?
2016 Puerto Rico Team Selection Test, 1
The integers $1, 2, 3,. . . , 2016$ are written in a board. You can choose any pair of numbers in the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After such replacements, the board will have only one number.
(a) Prove that there is a sequence of substitutions that will make let the final number be $2$.
(b) Prove that there is a sequence of substitutions that will make let the final number be $1000$.
2002 Greece JBMO TST, 1
Real numbers $x,y,a$ are such that $x+y=x^2+y^2=x^3+y^3=a$. Find all the possible values of $a$.
2010 IFYM, Sozopol, 1
We are given the equation $x^3-cx^2+(c-3)x+1=0$, where $c$ is an arbitrary number. Prove that, if the equation has at least one rational root, then all of its roots are rational.
2021 Regional Olympiad of Mexico Center Zone, 6
The sequence $a_1,a_2,\dots$ of positive integers obeys the following two conditions:
[list]
[*] For all positive integers $m,n$, it happens that $a_m\cdot a_n=a_{mn}$
[*] There exist infinite positive integers $n$ such that $(a_1,a_2,\dots,a_n)$ is a permutation of $(1,2,\dots,n)$
[/list]
Prove that $a_n=n$ for all positive integers $n$.
[i]Proposed by José Alejandro Reyes González[/i]
1995 Denmark MO - Mohr Contest, 2
Find all sets of five consecutive integers with that property that the sum of the squares of the first three numbers is equal to the sum of the squares on the last two.
2002 China Team Selection Test, 2
For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always:
\[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]
2014 JBMO Shortlist, 1
Solve in positive real numbers: $n+ \lfloor \sqrt{n} \rfloor+\lfloor \sqrt[3]{n} \rfloor=2014$
2019 Argentina National Olympiad, 1
A set of distinct positive integers is called [i]singular [/i] if, for each of its elements, after crossing out that element, the remaining ones can be grouped into two sets with no common elements such that the sum of the elements in the two groups is the same. Find the smallest positive integer $n>1$ such that there exists a singular set $A$ with $n$ items.
2010 Stanford Mathematics Tournament, 9
For an acute triangle $ABC$ and a point $X$ satisfying $\angle{ABX}+\angle{ACX}=\angle{CBX}+\angle{BCX}$.
Find the minimum length of $AX$ if $AB=13$, $BC=14$, and $CA=15$.
1986 AIME Problems, 11
The polynomial $1-x+x^2-x^3+\cdots+x^{16}-x^{17}$ may be written in the form $a_0+a_1y+a_2y^2+\cdots +a_{16}y^{16}+a_{17}y^{17}$, where $y=x+1$ and thet $a_i$'s are constants. Find the value of $a_2$.
MMPC Part II 1958 - 95, 1981
[b]p1.[/b] A canoeist is paddling upstream in a river when she passes a log floating downstream,, She continues upstream for awhile, paddling at a constant rate. She then turns around and goes downstream and paddles twice as fast. She catches up to the same log two hours after she passed it. How long did she paddle upstream?
[b]p2.[/b] Let $g(x) =1-\frac{1}{x}$ and define $g_1(x) = g(x)$ and $g_{n+1}(x) = g(g_n(x))$ for $n = 1,2,3, ...$. Evaluate $g_3(3)$ and $g_{1982}(l982)$.
[b]p3.[/b] Let $Q$ denote quadrilateral $ABCD$ where diagonals $AC$ and $BD$ intersect. If each diagonal bisects the area of $Q$ prove that $Q$ must be a parallelogram.
[b]p4.[/b] Given that: $a_1, a_2, ..., a_7$ and $b_1, b_2, ..., b_7$ are two arrangements of the same seven integers, prove that the product $(a_1-b_1)(a_2-b_2)...(a_7-b_7)$ is always even.
[b]p5.[/b] In analyzing the pecking order in a finite flock of chickens we observe that for any two chickens exactly one pecks the other. We decide to call chicken $K$ a king provided that for any other chicken $X, K$ necks $X$ or $K$ pecks a third chicken $Y$ who in turn pecks $X$. Prove that every such flock of chickens has at least one king. Must the king be unique?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2000 China Team Selection Test, 2
[b]a.)[/b] Let $a,b$ be real numbers. Define sequence $x_k$ and $y_k$ such that
\[x_0 = 1, y_0 = 0, x_{k+1} = a \cdot x_k - b \cdot y_l, \quad y_{k+1} = x_k - a \cdot y_k \text{ for } k = 0,1,2, \ldots \]
Prove that
\[x_k = \sum^{[k/2]}_{l=0} (-1)^l \cdot a^{k - 2 \cdot l} \cdot \left(a^2 + b \right)^l \cdot \lambda_{k,l}\]
where $\lambda_{k,l} = \sum^{[k/2]}_{m=l} \binom{k}{2 \cdot m} \cdot \binom{m}{l}$
[b]b.)[/b] Let $u_k = \sum^{[k/2]}_{l=0} \lambda_{k,l} $. For positive integer $m,$ denote the remainder of $u_k$ divided by $2^m$ as $z_{m,k}$. Prove that $z_{m,k},$ $k = 0,1,2, \ldots$ is a periodic function, and find the smallest period.
2013 India IMO Training Camp, 2
Let $n \ge 2$ be an integer and $f_1(x), f_2(x), \ldots, f_{n}(x)$ a sequence of polynomials with integer coefficients. One is allowed to make moves $M_1, M_2, \ldots $ as follows: in the $k$-th move $M_k$ one chooses an element $f(x)$ of the sequence with degree of $f$ at least $2$ and replaces it with $(f(x) - f(k))/(x-k)$. The process stops when all the elements of the sequence are of degree $1$. If $f_1(x) = f_2(x) = \cdots = f_n(x) = x^n + 1$, determine whether or not it is possible to make appropriate moves such that the process stops with a sequence of $n$ identical polynomials of degree 1.
1985 Vietnam National Olympiad, 2
Find all functions $ f \colon \mathbb{Z} \mapsto \mathbb{R}$ which satisfy:
i) $ f(x)f(y) \equal{} f(x \plus{} y) \plus{} f(x \minus{} y)$ for all integers $ x$, $ y$
ii) $ f(0) \neq 0$
iii) $ f(1) \equal{} \frac {5}{2}$
2014 Contests, 2
The first term of a sequence is $2014$. Each succeeding term is the sum of the cubes of the digits of the previous term. What is the $2014$ th term of the sequence?
2010 Postal Coaching, 4
Five distinct points $A, B, C, D$ and $E$ lie in this order on a circle of radius $r$ and satisfy $AC = BD = CE = r$. Prove that the orthocentres of the triangles $ACD, BCD$ and $BCE$ are the vertices of a right-angled triangle.
1994 China Team Selection Test, 1
Given $5n$ real numbers $r_i, s_i, t_i, u_i, v_i \geq 1 (1 \leq i \leq n)$, let $R = \frac {1}{n} \sum_{i=1}^{n} r_i$, $S = \frac {1}{n} \sum_{i=1}^{n} s_i$, $T = \frac {1}{n} \sum_{i=1}^{n} t_i$, $U = \frac {1}{n} \sum_{i=1}^{n} u_i$, $V = \frac {1}{n} \sum_{i=1}^{n} v_i$. Prove that $\prod_{i=1}^{n}\frac {r_i s_i
t_i u_i v_i + 1}{r_i s_i t_i u_i v_i - 1} \geq \left(\frac {RSTUV +1}{RSTUV - 1}\right)^n$.
1989 IMO Longlists, 81
A real-valued function $ f$ on $ \mathbb{Q}$ satisfies the following conditions for arbitrary $ \alpha, \beta \in \mathbb{Q}:$
[b](i)[/b] $ f(0) \equal{} 0,$
[b](ii)[/b] $ f(\alpha) > 0 \text{ if } \alpha \neq 0,$
[b](iii)[/b] $ f(\alpha \cdot \beta) \equal{} f(\alpha)f(\beta),$
[b](iv)[/b] $ f(\alpha \plus{} \beta) \leq f(\alpha) \plus{} f(\beta),$
[b](v)[/b] $ f(m) \leq 1989$ $ \forall m \in \mathbb{Z}.$
Prove that \[ f(\alpha \plus{} \beta) \equal{} \max\{f(\alpha), f(\beta)\} \text{ if } f(\alpha) \neq f(\beta).\]
2024 Girls in Mathematics Tournament, 4
Find all the positive integers $a,b,c$ such that $3ab= 2c^2$ and $a^3+b^3+c^3$ is the double of a prime number.