Found problems: 1340
Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is de fined as follows:
we have $a_0 = n$ and for $k \ge 1, a_k$ is the smallest integer greater than $a_{k-1}$ for which $a_k +a_{k-1}$ is the square of an integer.
Prove that there are exactly $\lfloor \sqrt{2n}\rfloor$ positive integers that cannot be written in the form $a_k - a_{\ell}$ with $k > \ell\ge 0$.
Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that
\[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\]
where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$
If $x$ is a real number, let $\lfloor x \rfloor$ be the greatest integer that is less than or equal to $x$. If $n$ is a positive integer, let $S(n)$ be defined by
\[
S(n)
= \left\lfloor \frac{n}{10^{\lfloor \log n \rfloor}} \right\rfloor
+ 10 \left( n - 10^{\lfloor \log n \rfloor}
\cdot \left\lfloor \frac{n}{10^{\lfloor \log n \rfloor}} \right\rfloor
\right) \, .
\]
(All the logarithms are base 10.) How many integers $n$ from 1 to 2011 (inclusive) satisfy $S(S(n)) = n$?
Let $f(n)$ be the integer closest to $\sqrt[4]{n}.$ Find $\sum_{k=1}^{1995}\frac 1{f(k)}.$
Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]
Let $\left[\sqrt{(n+1)^2 + n^2} \right], n = 1,2, \ldots,$ where $[x]$ denotes the integer part of $x.$ Prove that
[b]i.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m > 1;$
[b]ii.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m = 1.$
Let a,b,n be positive integers such that $(a,b) = 1$.
Prove that if $(x,y)$ is a solution of the equation $ax+by = a^n + b^n$ then
$$\left[\frac{x}{b}\right]+\left[\frac{y}{a}\right]=\left[\frac{a^{n-1}}{b}\right]+\left[\frac{b^{n-1}}{a}\right]$$
Let $\{x\} = x- \lfloor x \rfloor$ . Consider a function f from the set $\{1, 2, . . . , 2020\}$ to the half-open interval $[0, 1)$. Suppose that for all $x, y,$ there exists a $z$ so that $\{f(x) + f(y)\} = f(z)$. We say that a pair of integers $m, n$ is valid if $1 \le m, n \le 2020$ and there exists a function $f$ satisfying the above so $f(1) = \frac{m}{n}$. Determine the sum over all valid pairs $m, n$ of ${m}{n}$.
Powers of $2$ in base $10$ start with $3$ or $4$ more frequently? What is their state in base $3$? First write down an exact form of the question.
A ray of light originates from point $A$ and and travels in a plane, being reflected $n$ times between lines $AD$ and $CD$, before striking a point $B$ (which may be on $AD$ or $CD$) perpendicularly and retracing its path to $A$. (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for $n = 3.$) If $\measuredangle CDA = 8^\circ$, what is the largest value $n$ can have?
$\text{(A)} \ 6 \qquad \text{(B)} \ 10 \qquad \text{(C)} \ 38 \qquad \text{(D)} \ 98 \qquad \text{(E)} \ \text{There is no largest value.}$
Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$
Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$
Find all possible values of $x-\lfloor x\rfloor$ if $\sin \alpha = 3/5$ and $x=5^{2003}\sin {(2004\alpha)}$.
For an arbitrary real number $ x$, $ \lfloor x\rfloor$ denotes the greatest integer not exceeding $ x$. Prove that there is exactly one integer $ m$ which satisfy $ \displaystyle m\minus{}\left\lfloor \frac{m}{2005}\right\rfloor\equal{}2005$.
What is the enclosed area between the graph of $y=\lfloor 10x \rfloor + \sqrt{1-x^2}$ in the interval $[0,1]$ and the $x$ axis?
Let $ p$ be a prime number with $ p>5$. Consider the set $ X \equal{} \left\{p \minus{} n^2 \mid n\in \mathbb{N} ,\ n^2 < p\right\}$.
Prove that the set $ X$ has two distinct elements $ x$ and $ y$ such that $ x\neq 1$ and $ x\mid y$.
[i]Albania[/i]
Find the units digit in the decimal expansion of \[\left(2008+\sqrt{4032000}\right)^{2000}+\left(2008+\sqrt{4032000}\right)^{2001}+\left(2008+\sqrt{4032000}\right)^{2002}+\]\[\cdots+\left(2008+\sqrt{4032000}\right)^{2007}+\left(2008+\sqrt{4032000}\right)^{2008}.\]
Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?
Find the remainder modulo $101$ of
$$\left\lfloor \dfrac{1}{(2 \cos \left(\frac{4\pi}{7} \right))^{103}}\right\rfloor$$
Determine the maximum integer $ n $ such that for each positive integer $ k \le \frac{n}{2} $ there are two positive divisors of $ n $ with difference $ k $.
Let $ x$ be an arbitrary real number in $ (0,1)$. For every positive integer $ k$, let $ f_k(x)$ be the number of points $ mx\in [k,k \plus{} 1)$ $ m \equal{} 1,2,...$
Show that the sequence $ \sqrt [n]{f_1(x)f_2(x)\cdots f_n(x)}$ is convergent and find its limit.
Describe which positive integers do not belong to the set
\[E = \left\{ \lfloor n+ \sqrt n +\frac 12 \rfloor | n \in \mathbb N\right\}.\]
The sequence $a_i$ is defined as $a_1 = 1$ and
\[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\]
for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.
Thirty people sit at a round table. Each of them is either smart or dumb. Each of them is asked: "Is your neighbor to the right smart or dumb?" A smart person always answers correctly, while a dumb person can answer both correctly and incorrectly. It is known that the number of dumb people does not exceed $F$. What is the largest possible value of $F$ such that knowing what the answers of the people are, you can point at at least one person, knowing he is smart?
Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$
Define $\lfloor x \rfloor$ as the largest integer less than or equal to $x$. Define $\{x \} = x - \lfloor x \rfloor$. For example, $\{ 3 \} = 3-3 = 0$, $\{ \pi \} = \pi - 3$, and $\{ - \pi \} = 4-\pi$. If $\{n\} + \{ 3n\} = 1.4$, then find the sum of all possible values of $100\{n\}$.
[i]Proposed by Isabella Grabski
[/i]