Found problems: 1340
Let $-2 < x_1 < 2$ be a real number and define $x_2, x_3, \ldots$ by $x_{n+1} = x_n^2-2$ for $n \geq 1$. Assume that no $x_n$ is $0$ and define a number $A$, $0 \leq A \leq 1$ in the following way: The $n^{\text{th}}$ digit after the decimal point in the binary representation of $A$ is a $0$ if $x_1x_2\cdots x_n$ is positive and $1$ otherwise. Prove that $A = \frac{1}{\pi}\cos^{-1}\left(\frac{x_1}{2}\right)$.
[i]Evan O' Dorney.[/i]
Given a positive integer $ n>3$, prove that the least common multiple of the products $ x_1x_2\cdots x_k$ ($ k\geq 1$) whose factors $ x_i$ are positive integers with $ x_1\plus{}x_2\plus{}\cdots\plus{}x_k\le n$, is less than $ n!$.
Let $ k$ be a positive integer. Prove that there exist polynomials $ P_0(n),P_1(n),\dots,P_{k\minus{}1}(n)$ (which may depend on $ k$) such that for any integer $ n,$
\[ \left\lfloor\frac{n}{k}\right\rfloor^k\equal{}P_0(n)\plus{}P_1(n)\left\lfloor\frac{n}{k}\right\rfloor\plus{} \cdots\plus{}P_{k\minus{}1}(n)\left\lfloor\frac{n}{k}\right\rfloor^{k\minus{}1}.\]
($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
Let $c$ be a positive integer. Consider the sequence $x_1,x_2,\ldots$ which satisfies $x_1=c$ and, for $n\ge 2$,
\[x_n=x_{n-1}+\left\lfloor\frac{2x_{n-1}-(n+2)}{n}\right\rfloor+1\]
where $\lfloor x\rfloor$ denotes the largest integer not greater than $x$. Determine an expression for $x_n$ in terms of $n$ and $c$.
[i]Huang Yumin[/i]
The sequence $\{a_n\}_{n\ge 1}$ of real numbers is defined as follows:
$$a_1=1, \quad \text{and}\quad a_{n+1}=\frac{1}{2\lfloor a_n \rfloor -a_n+1} \quad \text{for all} \quad n\ge 1$$
Find $a_{2024}$.
Find a function $f(x)$ defined for all real values of $x$ such that for all $x$,
\[f(x+ 2) - f(x) = x^2 + 2x + 4,\]
and if $x \in [0, 2)$, then $f(x) = x^2.$
Let $a, b, c$, and $d$ be real numbers. Suppose that $\lfloor na\rfloor +\lfloor nb\rfloor =\lfloor nc\rfloor +\lfloor nd\rfloor $ for all positive integers $n$. Show that at least one of $a+b$, $a-c$, $a-d$ is an integer.
For a positive number such as 3.27, 3 is referred to as the integral part of the number and .27 as the decimal part. Find a positive number such that its decimal part, its integral part, and the number itself form a geometric progression.
The sum of several non-negative numbers is not greater than 200, while the sum of their squares is not less than 2500. Prove that among them there are four numbers whose sum is not less than 50.
[i]Proposed by A. Khabrov[/i]
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
Find the folllowing limit.
\[ \lim_{n\to\infty} \frac{(2n\plus{}1)\int_0^1 x^{n\minus{}1}\sin \left(\frac{\pi}{2}x\right)dx}{(n\plus{}1)^2\int_0^1 x^{n\minus{}1}\cos \left(\frac{\pi}{2}x\right)dx}\ \ (n\equal{}1,\ 2,\ \cdots).\]
Let $f(x, y) = \left\lfloor \frac{5x}{2y} \right\rfloor + \left\lceil \frac{5y}{2x} \right\rceil$. Suppose $x, y$ are chosen independently uniformly at random from the interval $(0, 1]$. Let $p$ be the probability that $f(x, y) < 6$. If $p$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$, compute $m + n$.
(Note: $\lfloor x\rfloor $ is defined as the greatest integer less than or equal to $x$ and $\lceil x \rceil$ is defined as the least integer greater than or equal to$ x$.)
Prove for all natural $n$ that $\left. {{{40}^n} \cdot n!} \right|(5n)!$
Let $m>1$ be an integer. Determine the number of positive integer solutions of the equation $\left\lfloor\frac xm\right\rfloor=\left\lfloor\frac x{m-1}\right\rfloor$.
Show that for all primes $p$, \[\sum^{p-1}_{k=1}\left \lfloor \frac{k^{3}}{p}\right \rfloor =\frac{(p+1)(p-1)(p-2)}{4}.\]
Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$.
[i]Proposed by Lewis Chen[/i]
Let $n$ be a natural number and $f(n) = 2n - 1995 \lfloor \frac{n}{1000} \rfloor$($\lfloor$ $\rfloor$ denotes the floor function).
1. Show that if for some integer $r$: $f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times), then $n$ is multiple of $1995$.
2. Show that if $n$ is multiple of 1995, then there exists r such that:$f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times). Determine $r$ if $n=1995.500=997500$
Prove that for all $n\in\mathbb{Z}^+$, we have \[ \sum\limits_{p=1}^n\sum\limits_{q=1}^p\left\lfloor -\frac{1+\sqrt{8q+(2p-1)^2}}{2}\right\rfloor =-\frac{n(n+1)(n+2)}{3} \]
Let $a=\lfloor \sqrt{n} \rfloor$ for given positive integer $n.$
Express the summation $\sum_{k=1}^{n}\lfloor \sqrt{k} \rfloor$ in terms of $n$ and $a.$
Given a positive integer $n$, let $a_1,a_2,..,a_n$ be a sequence of nonnegative integers. A sequence of one or more consecutive terms of $a_1,a_2,..,a_n$ is called $dragon$ if their aritmetic mean is larger than 1. If a sequence is a $dragon$, then its first term is the $head$ and the last term is the $tail$. Suppose $a_1,a_2,..,a_n$ is the $head$ or/and $tail$ of some $dragon$ sequence; determine the minimum value of $a_1+a_2+\cdots +a_n$ in terms of $n$.
Let $a$ be a positive integer.
How many non-negative integer solutions x does the equation
$\lfloor \frac{x}{a}\rfloor = \lfloor \frac{x}{a+1}\rfloor$
have?
$\lfloor ~ \rfloor$ ---> [url=http://en.wikipedia.org/wiki/Floor_function]Floor Function[/url].
Define $ f: \mathbb{R}\to\mathbb{R}$ by
\[ f(x)\equal{}\begin{cases}x&\text{if }x\le e\\ xf(\ln x)&\text{if }x>e\end{cases}\]
Does $ \displaystyle\sum_{n\equal{}1}^{\infty}\frac1{f(n)}$ converge?
Find the number of different numbers of the form $\left\lfloor\frac{i^2}{2015} \right\rfloor$, with $i = 1,2, ..., 2015$.
For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?
Positive integers $ a$, $ b$, and $ c$ are chosen so that $ a<b<c$, and the system of equations
\[ 2x\plus{}y\equal{}2003\text{ and }y\equal{}|x\minus{}a|\plus{}|x\minus{}b|\plus{}|x\minus{}c|
\]has exactly one solution. What is the minimum value of $ c$?
$ \textbf{(A)}\ 668 \qquad
\textbf{(B)}\ 669 \qquad
\textbf{(C)}\ 1002 \qquad
\textbf{(D)}\ 2003 \qquad
\textbf{(E)}\ 2004$