Found problems: 1340
Determine all real numbers $x\in\mathbb{R}$ for which
\[
\left\lfloor \frac{x}{2} \right\rfloor + \left\lfloor \frac{x}{3} \right\rfloor=x-2022.
\]
The notation $\lfloor z \rfloor$, for $z\in\mathbb{R}$, denotes the largest integer which is less than or equal to $z$. For example:
\[\lfloor 3.98 \rfloor =3 \quad \text{and} \quad \lfloor 0.14 \rfloor =0.\]
A positive integer $n$ is [i]magical[/i] if $\lfloor \sqrt{\lceil \sqrt{n} \rceil} \rfloor=\lceil \sqrt{\lfloor \sqrt{n} \rfloor} \rceil$. Find the number of magical integers between $1$ and $10,000$ inclusive.
What is the least positive integer $n$ such that $\overbrace{f(f(\dots f}^{21 \text{ times}}(n)))=2013$ where $f(x)=x+1+\lfloor \sqrt x \rfloor$? ($\lfloor a \rfloor$ denotes the greatest integer not exceeding the real number $a$.)
$
\textbf{(A)}\ 1214
\qquad\textbf{(B)}\ 1202
\qquad\textbf{(C)}\ 1186
\qquad\textbf{(D)}\ 1178
\qquad\textbf{(E)}\ \text{None of above}
$
Show that for all integers $a \ge 1$,$ \lfloor \sqrt{a}+\sqrt{a+1}+\sqrt{a+2}\rfloor = \lfloor \sqrt{9a+8}\rfloor$
What is the largest integer not exceeding $8x^3 +6x - 1$, where $x =\frac12 \left(\sqrt[3]{2+\sqrt5} + \sqrt[3]{2-\sqrt5}\right)$ ?
(A): $1$, (B): $2$, (C): $3$, (D): $4$, (E) None of the above.
Determine all $n \in \mathbb{N}$ for which [list][*] $n$ is not the square of any integer, [*] $\lfloor \sqrt{n}\rfloor ^3$ divides $n^2$. [/list]
Find all real numbers $a$ such that there exist $f:\mathbb{R} \to \mathbb{R}$ with $$f(x-f(y))=f(x)+a[y]$$ for all $x,y\in \mathbb{R}$
Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.
Determine all triples $(x,y,z)$ of real numbers that satisfy all of the following three equations:
$$\begin{cases} \lfloor x \rfloor + \{y\} =z \\ \lfloor y \rfloor + \{z\} =x \\ \lfloor z \rfloor + \{x\} =y \end{cases}$$
On the blackboard, there are numbers $1, 2, \dots , 100$. At each move, Bob erases arbitrary two numbers $a$ and $b$, where $a \ge b > 0$, and writes the single number $\lfloor{a/b}\rfloor$. After $99$ such moves the blackboard will contain a single number. What is its maximum possible value? (Reminder that $\lfloor{x}\rfloor$ is the maximum integer not exceeding $x$.)
Let $n$ be largest number such that \[ \frac{2014^{100!}-2011^{100!}}{3^n} \] is still an integer. Compute the remainder when $3^n$ is divided by $1000$.
I give you a deck of $n$ cards numbered $1$ through $n$. On each turn, you take the top card of the deck and place it anywhere you choose in the deck. You must arrange the cards in numerical order, with card $1$ on top and card $n$ on the bottom. If I place the deck in a random order before giving it to you, and you know the initial order of the cards, what is the expected value of the minimum number of turns you need to arrange the deck in order?
(a) We say that a hyperplane $H$ that is given with this equation
\[H=\{(x_1,\dots,x_n)\in \mathbb R^n \mid a_1x_1+ \dots +a_nx_n=b\}\]
($a=(a_1,\dots,a_n)\in \mathbb R^n$ and $b\in \mathbb R$ constant) bisects the finite set $A\subseteq \mathbb R^n$ if each of the two halfspaces $H^+=\{(x_1,\dots,x_n)\in \mathbb R^n \mid a_1x_1+ \dots +a_nx_n>b\}$ and $H^-=\{(x_1,\dots,x_n)\in \mathbb R^n \mid a_1x_1+ \dots +a_nx_n<b\}$ have at most $\lfloor \tfrac{|A|}{2}\rfloor$ points of $A$.
Suppose that $A_1,\dots,A_n$ are finite subsets of $\mathbb R^n$. Prove that there exists a hyperplane $H$ in $\mathbb R^n$ that bisects all of them at the same time.
(b) Suppose that the points in $B=A_1\cup \dots \cup A_n$ are in general position. Prove that there exists a hyperplane $H$ such that $H^+\cap A_i$ and $H^-\cap A_i$ contain exactly $\lfloor \tfrac{|A_i|}{2}\rfloor$ points of $A_i$.
(c) With the help of part (b), show that the following theorem is true: Two robbers want to divide an open necklace that has $d$ different kinds of stones, where the number of stones of each kind is even, such that each of the robbers receive the same number of stones of each kind. Show that the two robbers can accomplish this by cutting the necklace in at most $d$ places.
[i]The Algorithm.[/i] There are thirteen broken computers situated at the following set $S$ of thirteen points in the plane:
\[\begin{array}{ccc}A=(1,10)&B=(976,9)&C=(666,87)\\D=(377,422)&E=(535,488)&F=(775,488) \\ G=(941,500) & H=(225,583)&I=(388,696)\\J=(3,713)&K=(504,872)&L=(560,934)\\&M=(22,997)&\end{array}\]
At time $t=0$, a repairman begins moving from one computer to the next, traveling continuously in straight lines at unit speed. Assuming the repairman begins and $A$ and fixes computers instantly, what path does he take to minimize the [i]total downtime[/i] of the computers? List the points he visits in order. Your score will be $\left\lfloor \dfrac{N}{40}\right\rfloor$, where \[N=1000+\lfloor\text{the optimal downtime}\rfloor - \lfloor \text{your downtime}\rfloor ,\] or $0$, whichever is greater. By total downtime we mean the sum \[\sum_{P\in S}t_P,\] where $t_P$ is the time at which the repairman reaches $P$.
A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles.
[i]Calvin Deng.[/i]
Compute the sum of all positive real numbers $x \le 5$ satisfying $$x =\frac{ \lceil x^2 \rceil + \lceil x \rceil \cdot \lfloor x \rfloor}{ \lceil x\rceil + \lfloor x \rfloor}$$
Let $M$ be the set of palindromic integers of the form $5n+4$ where $n\ge 0$ is an integer.
[list=a]
[*]If we write the elements of $M$ in increasing order, what is the $50^{\text{th}}$ number?
[*]Among all numbers in $M$ with nonzero digits which sum up to $2014$ which is the largest and smallest one?[/list]
Consider a rectangular grid of $ 10 \times 10$ unit squares. We call a [i]ship[/i] a figure made up of unit squares connected by common edges. We call a [i]fleet[/i] a set of ships where no two ships contain squares that share a common vertex (i.e. all ships are vertex-disjoint). Find the least number of squares in a fleet to which no new ship can be added.
If $n\ge2$ is an integer, prove the equality
$$\lfloor\log_2n\rfloor+\lfloor\log_3n\rfloor+\ldots+\lfloor\log_nn\rfloor=\left\lfloor\sqrt n\right\rfloor+\left\lfloor\sqrt[3]n\right\rfloor+\ldots+\left\lfloor\sqrt[n]n\right\rfloor.$$
[color=darkblue]Weightlifter Ruslan has just finished the exercise with a weight, which has $ n$ small weights on one side and $ n$ on the another. At each stage he takes some weights from one of the sides, such that at any moment the difference of the numbers of weights on the sides does not exceed $ k$. What is the minimal number of stages (in function if $ n$ and $ k$), which Ruslan need to take off all weights..[/color]
Let $n$ be a natural number. Prove that \[ \left\lfloor \frac{n+2^0}{2^1} \right\rfloor + \left\lfloor \frac{n+2^1}{2^2} \right\rfloor +\cdots +\left\lfloor \frac{n+2^{n-1}}{2^n}\right\rfloor =n. \]
[hide="Remark"]For any real number $x$, the number $\lfloor x \rfloor$ represents the largest integer smaller or equal with $x$.[/hide]
a) Prove that $\lfloor x\rfloor$ is odd iff $\Big\lfloor 2\{\frac{x}{2}\}\Big\rfloor=1$ ($\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$ and $\{x\}=x-\lfloor x\rfloor$).
b) Let $n$ be a natural number. Find the number of [i]square free[/i] numbers $a$, such that $\Big\lfloor\frac{n}{\sqrt{a}}\Big\rfloor$ is odd. (A natural number is [i]square free[/i] if it's not divisible by any square of a prime number).
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$
Let $n$ and $k$ are integers with $n>0$. Prove that \[-\frac{1}{2n}\sum^{n-1}_{m=1}\cot \frac{\pi m}{n}\sin \frac{2\pi km}{n}= \begin{cases}\tfrac{k}{n}-\lfloor\tfrac{k}{n}\rfloor-\frac12 & \text{if }k|n \\ 0 & \text{otherwise}\end{cases}.\]
Find all polynomials $P$ with integer coefficients, for which there exists a number $N$, such that for every natural number $n \geq N$, all prime divisors of $n+2^{\lfloor \sqrt{n} \rfloor}$ are also divisors of $P(n)$.