Found problems: 1187
Let $a$ be a real number such that $\frac{1}{a}=a-[a]$. Show that $a$ is irrational.
Clarification: The brackets indicate the integer part of the number they enclose.
Let $ X_1,X_2,\ldots, X_n$ be independent, identically distributed, nonnegative random variables with a common continuous distribution function $ F$. Suppose in addition that the inverse of $ F$, the quantile function $ Q$, is also continuous and $ Q(0)=0$. Let $ 0=X_{0: n} \leq X_{1: n} \leq \ldots \leq X_{n: n}$ be the ordered sample from the above random variables. Prove that if $ EX_1$ is finite, then the random variable \[ \Delta = \sup_{0\leq y \leq 1} \left| \frac 1n \sum_{i=1}^{\lfloor ny \rfloor +1} (n+1-i)(X_{i: n}-X_{i-1: n})- \int_0^y (1-u)dQ(u) \right|\] tends to zero with probability one as $ n \rightarrow \infty$.
[i]S. Csorgp, L. Horvath[/i]
Let $a_1 = \sqrt 7$ and $b_i = \lfloor a_i \rfloor$, $a_{i+1} = \dfrac{1}{b_i - \lfloor b_i \rfloor}$ for each $i\geq i$. What is the smallest integer $n$ greater than $2004$ such that $b_n$ is divisible by $4$? ($\lfloor x \rfloor$ denotes the largest integer less than or equal to $x$)
$
\textbf{(A)}\ 2005
\qquad\textbf{(B)}\ 2006
\qquad\textbf{(C)}\ 2007
\qquad\textbf{(D)}\ 2008
\qquad\textbf{(E)}\ \text{None of above}
$
Let $p$ be an odd prime $p$ such that $2h \neq 1 \; \pmod{p}$ for all $h \in \mathbb{N}$ with $h< p-1$, and let $a$ be an even integer with $a \in] \tfrac{p}{2}, p [$. The sequence $\{a_n\}_{n \ge 0}$ is defined by $a_{0}=a$, $a_{n+1}=p -b_{n}$ \; $(n \ge 0)$, where $b_{n}$ is the greatest odd divisor of $a_n$. Show that the sequence $\{a_n\}_{n \ge 0}$ is periodic and find its minimal (positive) period.
Let $ x_0 \equal{} 1$ and for $ n\ge0,$ let $ x_{n \plus{} 1} \equal{} 3x_n \plus{} \left\lfloor x_n\sqrt {5}\right\rfloor.$ In particular, $ x_1 \equal{} 5,\ x_2 \equal{} 26,\ x_3 \equal{} 136,\ x_4 \equal{} 712.$ Find a closed-form expression for $ x_{2007}.$ ($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
Let $p$ be a prime number of the form $4k+1$. Show that \[\sum^{p-1}_{i=1}\left( \left \lfloor \frac{2i^{2}}{p}\right \rfloor-2\left \lfloor \frac{i^{2}}{p}\right \rfloor \right) = \frac{p-1}{2}.\]
The remainder can be defined for all real numbers $x$ and $y$ with $y \neq 0$ by $$\text{rem} (x ,y)=x-y\left \lfloor \frac{x}{y} \right \rfloor$$ where $\left \lfloor \tfrac{x}{y} \right \rfloor$ denotes the greatest integer less than or equal to $\tfrac{x}{y}$. What is the value of $\text{rem} (\tfrac{3}{8}, -\tfrac{2}{5} )$?
$\textbf{(A) } -\frac{3}{8} \qquad \textbf{(B) } -\frac{1}{40} \qquad \textbf{(C) } 0 \qquad \textbf{(D) } \frac{3}{8} \qquad \textbf{(E) } \frac{31}{40}$
Let $ m$ be a positive integer and define $ f(m)$ to be the number of factors of $ 2$ in $ m!$ (that is, the greatest positive integer $ k$ such that $ 2^k|m!$). Prove that there are infinitely many positive integers $ m$ such that $ m \minus{} f(m) \equal{} 1989.$
Find the number of solutions in positive integers of the equation $\lfloor \frac{x}{2} \rfloor = \lfloor \frac{x}{11} \rfloor +1$
where $\lfloor A\rfloor$ denotes the integer part of the number $A$, e.g. $\lfloor 2.031\rfloor = 2$, $\lfloor 2\rfloor = 2$, etc.
Let $x$ be a solution to the equation $\lfloor x \lfloor x + 2\rfloor + 2\rfloor = 10$. Compute the smallest $C$ such that for any solution $x$, $x < C$. Here, $\lfloor m \rfloor$ is defined as the greatest integer less than or equal to $m$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor -4.25\rfloor = -5$.
On a soccer tournament with $n\ge 3$ teams taking part, several matches are played in such a way that among any three teams, some two play a match.
$(a)$ If $n=7$, find the smallest number of matches that must be played.
$(b)$ Find the smallest number of matches in terms of $n$.
Find all functions $ f: Z \rightarrow R$ that verify the folowing two conditions:
(i) for each pair of integers $ (m,n)$ with $ m<n$ one has $ f(m)<f(n)$;
(ii) for each pair of integers $ (m,n)$ there exists an integer $ k$ such that $ f(m)\minus{}f(n)\equal{}f(k)$.
Determine the largest positive integer $n$ such that $1005!$ is divisible by $10^n$.
$\textbf{(A) }102\qquad\textbf{(B) }112\qquad\textbf{(C) }249\qquad\textbf{(D) }502\qquad \textbf{(E) }\text{none of these}$
Let $a$ denote the positive real root of the polynomial $x^2 -3x-2$. Compute the remainder when $\lfloor a^{1000}\rfloor $ is divided by the prime number $997$. Here, $\lfloor r\rfloor$ denotes the greatest integer less than $r$.
Let $n$ be a fixed odd positive integer. For each odd prime $p$, define
$$a_p=\frac{1}{p-1}\sum_{k=1}^{\frac{p-1}{2}}\bigg\{\frac{k^{2n}}{p}\bigg\}.$$
Prove that there is a real number $c$ such that $a_p = c$ for infinitely many primes $p$.
[i]Note: $\left\{x\right\} = x - \left\lfloor x\right\rfloor$ is the fractional part of $x$.[/i]
Find all tuples $ (x_1,x_2,x_3,x_4,x_5)$ of positive integers with $ x_1>x_2>x_3>x_4>x_5>0$ and
$ {\left \lfloor \frac{x_1+x_2}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_2+x_3}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_3+x_4}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_4+x_5}{3} \right \rfloor }^2 = 38.$
Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.
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 $M$ be a nonempty subset of $\mathbb Z^+$ such that for every element $x$ in $M,$ the numbers $4x$ and $\lfloor \sqrt x \rfloor$ also belong to $M.$ Prove that $M = \mathbb Z^+.$
Let $ a,b,c $ be real numbers satisfying $ \left\lfloor a^2+b^2+c^2 \right\rfloor \le\lfloor ab+bc+ca \rfloor . $ Show that:
$$ 2 >\max\left\{ \left| -2a+b+c \right| ,\left| a-2b+c \right| ,\left| a+b-2c \right| \right\} $$
[i]Merticaru[/i]
Let $p, q$ and $r$ be positive real numbers such that the equation $$\lfloor pn \rfloor + \lfloor qn \rfloor + \lfloor rn \rfloor = n$$ is satisfied for infinitely many positive integers $n{}$.
(a) Prove that $p, q$ and $r$ are rational.
(b) Determine the number of positive integers $c$ such that there exist positive integers $a$ and $b$, for which the equation $$\left \lfloor \frac{n}{a} \right \rfloor+\left \lfloor \frac{n}{b} \right \rfloor+\left \lfloor \frac{cn}{202} \right \rfloor=n$$ is satisfied for infinitely many positive integers $n{}$.
Trilandia is a very unusual city. The city has the shape of an equilateral triangle of side lenght 2012. The streets divide the city into several blocks that are shaped like equilateral triangles of side lenght 1. There are streets at the border of Trilandia too. There are 6036 streets in total. The mayor wants to put sentinel sites at some intersections of the city to monitor the streets. A sentinel site can monitor every street on which it is located. What is the smallest number of sentinel sites that are required to monitor every street of Trilandia?
Suppose that $A$ is a set of positive integers less than $N$ and that no two distinct elements of $A$ sum to a perfect square. That is, if $a_1, a_2 \in A$ and $a_1 \neq a_2$ then $|a_1+a_2|$ is not a square of an integer. Prove that the maximum number of elements in $A$ is at least $\left\lfloor\frac{11}{32}N\right\rfloor$ .
The integers from $1$ to $999999$ are partitioned into two groups: the first group consists of those integers for which the closest perfect square is odd, whereas the second group consists of those for which the closest perfect square is even. In which group is the sum of the elements greater?
Lines $l$ and $m$ are perpendicular. Line $l$ partitions a convex polygon into two parts of equal area, and partitions the projection of the polygon onto $m$ into two line segments of length $a$ and $b$ respectively. Determine the maximum value of $\left\lfloor \frac{1000a}{b} \right\rfloor$. (The floor notation $\lfloor x \rfloor$ denotes largest integer not exceeding $x$)