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: 61

1991 IMO Shortlist, 19

Let $ \alpha$ be a rational number with $ 0 < \alpha < 1$ and $ \cos (3 \pi \alpha) \plus{} 2\cos(2 \pi \alpha) \equal{} 0$. Prove that $ \alpha \equal{} \frac {2}{3}$.

PEN F Problems, 10

The set $ S$ is a finite subset of $ [0,1]$ with the following property: for all $ s\in S$, there exist $ a,b\in S\cup\{0,1\}$ with $ a, b\neq s$ such that $ s \equal{}\frac{a\plus{}b}{2}$. Prove that all the numbers in $ S$ are rational.

2012 Polish MO Finals, 1

Decide, whether exists positive rational number $w$, which isn't integer, such that $w^w$ is a rational number.

1967 IMO Longlists, 18

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

PEN F Problems, 14

Let $k$ and $m$ be positive integers. Show that \[S(m, k)=\sum_{n=1}^{\infty}\frac{1}{n(mn+k)}\] is rational if and only if $m$ divides $k$.

2013 Poland - Second Round, 5

Let $W(x)$ be a polynomial of integer coefficients such that for any pair of different rational number $r_1$, $r_2$ dependence $W(r_1) \neq W(r_2)$ is true. Decide, whether the assuptions imply that for any pair of different real numbers $t_1$, $t_2$ dependence $W(t_1) \neq W(t_2)$ is true.

2019 India IMO Training Camp, P1

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

PEN F Problems, 12

Does there exist a circle and an infinite set of points on it such that the distance between any two points of the set is rational?

2019 Brazil Team Selection Test, 2

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

2011 IFYM, Sozopol, 8

Let $a$ and $b$ be some rational numbers and there exist $n$, such that $\sqrt[n]{a}+\sqrt[b]{b}$ is also a rational number. Prove that $\sqrt[n]{a}$ is a rational number.

2019 Taiwan TST Round 2, 1

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

1967 IMO Longlists, 14

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

2017 Brazil National Olympiad, 1.

[b]1.[/b] For each real number $r$ between $0$ and $1$ we can represent $r$ as an infinite decimal $r = 0.r_1r_2r_3\dots$ with $0 \leq r_i \leq 9$. For example, $\frac{1}{4} = 0.25000\dots$, $\frac{1}{3} = 0.333\dots$ and $\frac{1}{\sqrt{2}} = 0.707106\dots$. a) Show that we can choose two rational numbers $p$ and $q$ between $0$ and $1$ such that, from their decimal representations $p = 0.p_1p_2p_3\dots$ and $q = 0.q_1q_2q_3\dots$, it's possible to construct an irrational number $\alpha = 0.a_1a_2a_3\dots$ such that, for each $i = 1, 2, 3, \dots$, we have $a_i = p_1$ or $a_1 = q_i$. b) Show that there's a rational number $s = 0.s_1s_2s_3\dots$ and an irrational number $\beta = 0.b_1b_2b_3\dots$ such that, for all $N \geq 2017$, the number of indexes $1 \leq i \leq N$ satisfying $s_i \neq b_i$ is less than or equal to $\frac{N}{2017}$.

1983 IMO Longlists, 23

Let $p$ and $q$ be integers. Show that there exists an interval $I$ of length $1/q$ and a polynomial $P$ with integral coefficients such that \[ \left|P(x)-\frac pq \right| < \frac{1}{q^2}\]for all $x \in I.$

2016 Postal Coaching, 1

Show that there are infinitely many rational triples $(a, b, c)$ such that $$a + b + c = abc = 6.$$

PEN F Problems, 3

Let $ \alpha$ be a rational number with $ 0 < \alpha < 1$ and $ \cos (3 \pi \alpha) \plus{} 2\cos(2 \pi \alpha) \equal{} 0$. Prove that $ \alpha \equal{} \frac {2}{3}$.

Russian TST 2017, P2

Prove that every rational number is representable as $x^4+y^4-z^4-t^4$ with rational $x,y,z,t$.

2019 Switzerland Team Selection Test, 3

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

2020 Bundeswettbewerb Mathematik, 2

Prove that there are no rational numbers $x,y,z$ with $x+y+z=0$ and $x^2+y^2+z^2=100$.

2019 India Regional Mathematical Olympiad, 1

Suppose $x$ is a non zero real number such that both $x^5$ and $20x+\frac{19}{x}$ are rational numbers. Prove that $x$ is a rational number.

Russian TST 2016, P3

Prove that any rational number can be represented as a product of four rational numbers whose sum is zero.

PEN F Problems, 9

Prove that every positive rational number can be represented in the form \[\frac{a^{3}+b^{3}}{c^{3}+d^{3}}\] for some positive integers $a, b, c$, and $d$.

2019 Poland - Second Round, 3

Let $f(t)=t^3+t$. Decide if there exist rational numbers $x, y$ and positive integers $m, n$ such that $xy=3$ and: \begin{align*} \underbrace{f(f(\ldots f(f}_{m \ times}(x))\ldots)) = \underbrace{f(f(\ldots f(f}_{n \ times}(y))\ldots)). \end{align*}

1990 IMO Shortlist, 28

Prove that on the coordinate plane it is impossible to draw a closed broken line such that [i](i)[/i] the coordinates of each vertex are rational; [i](ii)[/i] the length each of its edges is 1; [i](iii)[/i] the line has an odd number of vertices.