Prove that the sequence $a_{n}=\lfloor n\sqrt 2 \rfloor+\lfloor n\sqrt 3 \rfloor$ contains infintely many even and infinitely many odd numbers.

Let $K$, in square units, be the area of a trapezoid such that the shorter base, the altitude, and the longer base, in that order, are in arithmetic progression. Then: $\textbf{(A)}\ K \; \text{must be an integer} \qquad \textbf{(B)}\ K \; \text{must be a rational fraction} \\ \textbf{(C)}\ K \; \text{must be an irrational number} \qquad \textbf{(D)}\ K\; \text{must be an integer or a rational fraction} \qquad$ $\textbf{(E)}\ \text{taken alone neither} \; \textbf{(A)} \; \text{nor} \; \textbf{(B)} \; \text{nor} \; \textbf{(C)} \; \text{nor} \; \textbf{(D)} \; \text{is true}$

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

For a positive real number $\alpha$, define \[S(\alpha)=\{ \lfloor n\alpha\rfloor \; \vert \; n=1,2,3,\cdots \}.\] Prove that $\mathbb{N}$ cannot be expressed as the disjoint union of three sets $S(\alpha)$, $S(\beta)$, and $S(\gamma)$.

Show that $\cos 1^{\circ}$ is irrational.

[b]a)[/b] Give example of two irrational numbers $ a,b $ having the property that $ a^3,b^3,a+b $ are all rational. [b]b)[/b] Prove that if $ x,y $ are two nonnegative real numbers having the property that $ x^3,y^3,x+y $ are rational, then $ x $ and $ y $ are both rational. [i]Mihai Piticari[/i] and [i]Vladimir Cerbu[/i]

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]

For a given irrational number $\alpha$ , $y_{1,\alpha} = \alpha$. If $y_{n-1, \alpha}$ is given, let $y_{n, \alpha}$ be the first member of the sequence $\big (\{k \alpha \} \big) ^ \infty_{k = 1}$ to fall in the interval $(0, y_{n-1,\alpha})$ ({ x } denotes the fraction of the number x ). Show that there exists an open set $G\subset (0,1)$ , which has a limit point 0 and for all irrational $\alpha$ , infinitely many members of the $(y_{n,\alpha})$ sequence do not belong to G.

Let $r=0.d_0d_1d_2\ldots$ be a real number. Let $e_n$ denote the number formed by the digits $d_n, d_{n-1}, \ldots, d_0$ written from left to right (leading zeroes are permitted). Given that $d_0=6$ and for each $n \geq 0$, $e_n$ is equal to the number formed by the $n+1$ rightmost digits of $e_n^2$. Show that $r$ is irrational.

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} $

Let $p$ be the product of $n$ real numbers $x_1$, $x_2$,$...$, $x_n$. Prove that if $p - x_k$ is an odd integer for $k = 1, 2,..., n$, then each of the numbers $x_1$, $x_2$,$...$, $x_n$is irrational. (G Galperin)

You are given three lists A, B, and C. List A contains the numbers of the form $10^{k}$ in base 10, with $k$ any integer greater than or equal to 1. Lists B and C contain the same numbers translated into base 2 and 5 respectively: \[\begin{array}{lll}A & B & C \\ 10 & 1010 & 20 \\ 100 & 1100100 & 400 \\ 1000 & 1111101000 & 13000 \\ \vdots & \vdots & \vdots \end{array}.\] Prove that for every integer $n > 1$, there is exactly one number in exactly one of the lists B or C that has exactly $n$ digits.

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 that for every natural number $k$ ($k \geq 2$) there exists an irrational number $r$ such that for every natural number $m$, \[[r^m] \equiv -1 \pmod k .\] [i]Remark.[/i] An easier variant: Find $r$ as a root of a polynomial of second degree with integer coefficients. [i]Proposed by Yugoslavia.[/i]

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.

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.