Let be two natural primes $ 1\le q \le p. $ Prove that $ \left( \sqrt{p^2+q} +p\right)^2 $ is irrational and its fractional part surpasses $ 3/4. $

Prove that if $g \ge 2$ is an integer, then two series \[\sum_{n=0}^{\infty}\frac{1}{g^{n^{2}}}\;\; \text{and}\;\; \sum_{n=0}^{\infty}\frac{1}{g^{n!}}\] both converge to irrational numbers.

Prove the following statement: If $r_1$ and $r_2$ are real numbers whose quotient is irrational, then any real number $x$ can be approximated arbitrarily well by the numbers of the form $\ z_{k_1,k_2} = k_1r_1 + k_2r_2$ integers, i.e. for every number $x$ and every positive real number $p$ two integers $k_1$ and $k_2$ can be found so that $|x - (k_1r_1 + k_2r_2)| < p$ holds.

Show that the cube roots of three distinct primes cannot be terms in an arithmetic progression.

Let $x$ be an irrational number between 0 and 1 and $x = 0.a_1a_2a_3\cdots$ its decimal representation. For each $k \ge 1$, let $p(k)$ denote the number of distinct sequences $a_{j+1} a_{j+2} \cdots a_{j+k}$ of $k$ consecutive digits in the decimal representation of $x$. Prove that $p(k) \ge k+1$ for every positive integer $k$.

Let $\{a_{n}\}_{n \ge 1}$ be a sequence of positive numbers such that \[a_{n+1}^{2}= a_{n}+1, \;\; n \in \mathbb{N}.\] Show that the sequence contains an irrational number.

Suppose $\alpha, \beta$ are two positive rational numbers. Assume for some positive integers $m,n$, it is known that $\alpha^{\frac 1n}+\beta^{\frac 1m}$ is a rational number. Prove that each of $\alpha^{\frac 1n}$ and $\beta^{\frac 1m}$ is a rational number.

Given a set $S$ of $2n-1$, $n\in \mathbb N$, different irrational numbers. Prove that there are $n$ different elements $x_1, x_2, \ldots, x_n\in S$ such that for all non-negative rational numbers $a_1, a_2, \ldots, a_n$ with $a_1+a_2+\ldots + a_n>0$ we have that $a_1x_1+a_2x_2+\cdots +a_nx_n$ is an irrational number.

We call a positive integer $q$ a $convenient \quad denominator$ for a real number $\alpha$ if $\displaystyle |\alpha - \dfrac{p}{q}|<\dfrac{1}{10q}$ for some integer $p$. Prove that if two irrational numbers $\alpha$ and $\beta$ have the same set of convenient denominators then either $\alpha+\beta$ or $\alpha- \beta$ is an integer.

Let $a, b$ and $c$ be positive real numbers such that $$a^2+ab+ac-bc = 0.$$ a) Show that if two of the numbers $a, b$ and $c$ are equal, then at least one of the numbers $a, b$ and $c$ is irrational. b) Show that there exist infinitely many triples $(m, n, p)$ of positive integers such that $$m^2 + mn + mp -np = 0.$$

$\alpha,\beta$ are positive irrational numbers and $[\alpha[\beta x]]=[\beta[\alpha x]]$ for every positive $x$. Prove that $\alpha=\beta$

Show that $e=\sum^{\infty}_{n=0} \frac{1}{n!}$ is irrational.

Let $a, b, c$ be integers, not all zero and each of absolute value less than one million. Prove that \[\left\vert a+b\sqrt{2}+c\sqrt{3}\right\vert > \frac{1}{10^{21}}.\]

Prove that if $ \alpha$ and $ \beta$ are positive irrational numbers satisfying $ \frac{1}{\alpha}\plus{}\frac{1}{\beta}\equal{} 1$, then the sequences \[ \lfloor\alpha\rfloor,\lfloor 2\alpha\rfloor,\lfloor 3\alpha\rfloor,\cdots\] and \[ \lfloor\beta\rfloor,\lfloor 2\beta\rfloor,\lfloor 3\beta\rfloor,\cdots\] together include every positive integer exactly once.

Let $a_0$ be an irrational number such that $0 < a_0 < \frac 12$ . Define $a_n = \min \{2a_{n-1},1 - 2a_{n-1}\}$ for $n \geq 1$. [list][b](a)[/b] Prove that $a_n < \frac{3}{16}$ for some $n$. [b](b)[/b] Can it happen that $a_n > \frac{7}{40}$ for all $n$?[/list]

$ \forall n > 0, n \in \mathbb{Z},$ there exists uniquely determined integers $ a_n, b_n, c_n \in \mathbb{Z}$ such \[ \left(1 \plus{} 4 \cdot \sqrt[3]{2} \minus{} 4 \cdot \sqrt[3]{4} \right)^n \equal{} a_n \plus{} b_n \cdot \sqrt[3]{2} \plus{} c_n \cdot \sqrt[3]{4}.\] Prove that $ c_n \equal{} 0$ implies $ n \equal{} 0.$

Prove that for any $ p, q\in\mathbb{N}$ with $ q > 1$ the following inequality holds: \[ \left\vert\pi\minus{}\frac{p}{q}\right\vert\ge q^{\minus{}42}.\]

Let $ a, b, c$ be integers, not all equal to $ 0$. Show that \[ \frac{1}{4a^{2}\plus{}3b^{2}\plus{}2c^{2}}\le\vert\sqrt[3]{4}a\plus{}\sqrt[3]{2}b\plus{}c\vert.\]

Find all irrational real numbers $\alpha$ such that \[ \alpha^3 - 15 \alpha \text{ and } \alpha^4 - 56 \alpha \] are both rational numbers.

If $\log_{2x}216 = x$, where $x$ is real, then $x$ is: $ \textbf{(A)}\ \text{A non-square, non-cube integer} \qquad$ $\textbf{(B)}\ \text{A non-square, non-cube, non-integral rational number} \qquad$ $\textbf{(C)}\ \text{An irrational number} \qquad$ $\textbf{(D)}\ \text{A perfect square}\qquad$ $\textbf{(E)}\ \text{A perfect cube} $

a) Denote by $S(n)$ the sum of digits of a positive integer $n$. After the decimal point, we write one after the other the numbers $S(1),S(2),...$. Show that the number obtained is irrational. b) Denote by $P(n)$ the product of digits of a positive integer $n$. After the decimal point, we write one after the other the numbers $P(1),P(2),...$. Show that the number obtained is irrational.

Prove the following statement: If $r_1$ and $r_2$ are real numbers whose quotient is irrational, then any real number $x$ can be approximated arbitrarily well by the numbers of the form $\ z_{k_1,k_2} = k_1r_1 + k_2r_2$ integers, i.e. for every number $x$ and every positive real number $p$ two integers $k_1$ and $k_2$ can be found so that $|x - (k_1r_1 + k_2r_2)| < p$ holds.

Let $\sqrt 3 = 1.b_1b_2b_3 \dots _{(2)}$ be the binary representation of $\sqrt 3$. Prove that for any positive integer $n$, at least one of the digits $b_n$, $b_{n+1}$, $\dots$, $b_{2n}$ equals $1$.

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).

Denote by $\lfloor x\rfloor$ the greatest positive integer less than or equal to $x$. Let $m\ge2$ be an integer, and let $s$ be a real number between $0$ and $1$. Define an infinite sequence of real numbers $a_1, a_2, a_3,\ldots$ by setting $a_1 = s$ and $ak = ma_{k-1}-(m-1)\lfloor a_{k-1}\rfloor$ for all $k\ge2$. For example, if $m = 3$ and $s = \tfrac58$, then we get $a_1 = \tfrac58$, $a_2 = \tfrac{15}8$, $a_3 = \tfrac{29}8$, $a_4 = \tfrac{39}8$, and so on. Call the sequence $a_1, a_2, a_3,\ldots$ $\textbf{orderly}$ if we can find rational numbers $b, c$ such that $\lfloor a_n\rfloor = \lfloor bn + c\rfloor$ for all $n\ge1$. With the example above where $m = 3$ and $s = \tfrac58$, we get an orderly sequence since $\lfloor a_n\rfloor = \left\lfloor\tfrac{3n}2-\tfrac32\right\rfloor$ for all $n$. Show that if $s$ is an irrational number and $m\ge2$ is any integer, then the sequence $a_1, a_2, a_3,\ldots$ is $\textbf{not}$ an orderly sequence.