Found problems: 1340
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=a_{n}+\lfloor \sqrt{a_{n}}\rfloor.\] Show that $a_{n}$ is a square if and only if $n=2^{k}+k-2$ for some $k \in \mathbb{N}$.
Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \]
[i]Carl Schildkraut[/i]
Square $S$ is the unit square with vertices at $(0, 0)$, $(0, 1)$, $(1, 0)$ and $(1, 1)$. We choose a random point $(x, y)$ inside $S$ and construct a rectangle with length $x$ and width $y$. What is the average of $\lfloor p \rfloor$ where $p$ is the perimeter of the rectangle? $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.
In a country, there are some two-way roads between the cities. There are $2010$ roads connected to the capital city. For all cities different from the capital city, there are less than $2010$ roads connected to that city. For two cities, if there are the same number of roads connected to these cities, then this number is even. $k$ roads connected to the capital city will be deleted. It is wanted that whatever the road network is, if we can reach from one city to another at the beginning, then we can reach after the deleting process also. Find the maximum value of $k.$
Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$
[i]Andrew Carratu[/i]
A doubly-indexed sequence $a_{m,n}$, for $m$ and $n$ nonnegative integers, is defined as follows:
[list]
[*]$a_{m,0}=0$ for all $m>0$ and $a_{0,0}=1$.
[*]$a_{m,1}=0$ for all $m>1$, $a_{1,1}=1$, and $a_{0,1}=0$.
[*]$a_{0,n}=a_{0,n-1}+a_{0,n-2}$ for all $n\geq 2$.
[*]$a_{m,n}=a_{m,n-1}+a_{m,n-2}+a_{m-1,n-1}-a_{m-1,n-2}$ for all $m>0$, $n\geq 2$.
[/list]
Then there exists a unique value of $x$ so $\sum_{m=0}^{\infty}\sum_{n=0}^{\infty}\frac{a_{m,n}x^m}{3^{n-m}}=1$. Find $\lfloor 1000x^2 \rfloor$.
Find the number of positive integers $n$ such that $1\leq n\leq 1000$ and $n$ is divisible by $\lfloor \sqrt[3]{n} \rfloor$.
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.
[b]a)[/b] Among the $21$ pairwise distances between the $7$ points of the plane, prove that one and the same number occurs not more than $12$ times.
[b]b)[/b] Find a maximum number of times may meet the same number among the $15$ pairwise distances between $6$ points of the plane.
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.$