Found problems: 1187
For every positive integer $ n$ let
\[ a_n\equal{}\sum_{k\equal{}n}^{2n}\frac{(2k\plus{}1)^n}{k}\]
Show that there exists no $ n$, for which $ a_n$ is a non-negative integer.
Function $f(n), n \in \mathbb N$, is defined as follows:
Let $\frac{(2n)!}{n!(n+1000)!} = \frac{A(n)}{B(n)}$ , where $A(n), B(n)$ are coprime positive integers; if $B(n) = 1$, then $f(n) = 1$; if $B(n) \neq 1$, then $f(n)$ is the largest prime factor of $B(n)$. Prove that the values of $f(n)$ are finite, and find the maximum value of $f(n).$
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]
Let $B = (20, 14)$ and $C = (18, 0)$ be two points in the plane. For every line $\ell$ passing through $B$, we color red the foot of the perpendicular from $C$ to $\ell$. The set of red points enclose a bounded region of area $\mathcal{A}$. Find $\lfloor \mathcal{A} \rfloor$ (that is, find the greatest integer not exceeding $\mathcal A$).
[i]Proposed by Yang Liu[/i]
Within the real numbers, solve the equation $$x^5 + \lfloor x \rfloor = 20$$
where $\lfloor x \rfloor$ denotes the largest whole number less than or equal to $x$.
Determine all pairs $(a,b)$ of real numbers such that $a \lfloor bn \rfloor =b \lfloor an \rfloor $ for all positive integers $n$. (Note that $\lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$.)
$$\left\lfloor\left(1\cdot2+2\cdot2^2+\ldots+100\cdot2^{100}\right)\cdot9^{-901}\right\rfloor=?$$
Does there exist an irrational number $\alpha > 1$ such that
\[\lfloor \alpha^n \rfloor \equiv 0 \pmod{2017}\]
for all integers $n \ge 1$?
Let $k \in \mathbb{N},$ $S_k = \{(a, b) | a, b = 1, 2, \ldots, k \}.$ Any two elements $(a, b)$, $(c, d)$ $\in S_k$ are called "undistinguishing" in $S_k$ if $a - c \equiv 0$ or $\pm 1 \pmod{k}$ and $b - d \equiv 0$ or $\pm 1 \pmod{k}$; otherwise, we call them "distinguishing". For example, $(1, 1)$ and $(2, 5)$ are undistinguishing in $S_5$. Considering the subset $A$ of $S_k$ such that the elements of $A$ are pairwise distinguishing. Let $r_k$ be the maximum possible number of elements of $A$.
(i) Find $r_5$.
(ii) Find $r_7$.
(iii) Find $r_k$ for $k \in \mathbb{N}$.
Each of the subsets $ A_1$, $ A_2$, $ \dots,$ $ A_n$ of a 2009-element set $ X$ contains at least 4 elements. The intersection of every two of these subsets contains at most 2 elements. Prove that in $ X$ there is a 24-element subset $ B$ containing neither of the sets $ A_1$, $ A_2$, $ \dots,$ $ A_n$.
Let $a_1,a_2 \dots a_n$ and $x_1, x_2 \dots x_n$ be integers and $r\geq 2$ be an integer. It is known that \[\sum_{j=0}^{n} a_j x_j^k =0 \qquad \text{for} \quad k=1,2, \dots r.\]
Prove that
\[\sum_{j=0}^{n} a_j x_j^m \equiv 0 \pmod m, \qquad \text{for all}\quad m \in \{ r+1, r+2, \cdots, 2r+1 \}.\]
Show that there is a digit unequal to 2 in the decimal represesentation of $ \sqrt [3]{3}$ between the $ 1000000$-th und $ 3141592$-th position after decimal point.
There are $n$ lamps and $k$ switches in a room. Initially, each lamp is either turned on or turned off. Each lamp is connected by a wire with $2020$ switches. Switching a switch changes the state of a lamp, that is connected to it, to the opposite state. It is known that one can switch the switches so that all lamps will be turned on. Prove, that it is possible to achieve the same result by switching the switches no more than $ \left \lfloor \dfrac{k}{2} \right \rfloor$ times.
[i]Proposed by T. Zimanov[/i]
The largest integer not exceeding $[(n+1)a]-[na]$ where $n$ is a natural number, $a=\frac{\sqrt{2013}}{\sqrt{2014}}$ is:
(A): $1$, (B): $2$, (C): $3$, (D): $4$, (E) None of the above.
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?
Calculate $\displaystyle{\sum_{n=1}^\infty\left(\lfloor\sqrt[n]{2010}\rfloor-1\right)}$ where $\lfloor x\rfloor$ is the largest integer less than or equal to $x$.
Compute the sum of all real solutions $\alpha$ (in radians) to the equation
\[ |\sin\alpha|=\left\lfloor \frac{\alpha}{20} \right\rfloor. \]
You are given three lists A, B, and C. List A contains the numbers of the form $10^{k}$ in base 10, with $k$ any integer greater than or equal to 1. Lists B and C contain the same numbers translated into base 2 and 5 respectively: \[\begin{array}{lll}A & B & C \\ 10 & 1010 & 20 \\ 100 & 1100100 & 400 \\ 1000 & 1111101000 & 13000 \\ \vdots & \vdots & \vdots \end{array}.\] Prove that for every integer $n > 1$, there is exactly one number in exactly one of the lists B or C that has exactly $n$ digits.
What is the maximum number of checkers it is possible to put on a $ n \times n$ chessboard such that in every row and in every column there is an even number of checkers?
Find all solutions of the equation
$$sin\pi \sqrt x+cos\pi \sqrt x=(-1)^{\lfloor \sqrt x \rfloor }$$
For any positive integer $n$, let $f(n)$ be the number of possible choices of signs $+\ \text{or}\ - $ in the algebraic expression $\pm 1\pm 2\ldots \pm n$, such that the obtained sum is zero. Show that $f(n)$ satisfies the following conditions:
a) $f(n)=0$ for $n=1\pmod{4}$ or $n=2\pmod{4}$.
b) $2^{\frac{n}{2}-1}\le f(n)\le 2^n-2^{\lfloor\frac{n}{2}\rfloor+1}$, for $n=0\pmod{4}$ or $n=3\pmod{4}$.
[i]Ioan Tomsecu[/i]
Consider the sequence $a(n)$ defined by the following conditions:$$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by
\[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right),
\] where $\lfloor x\rfloor$ denotes the integer part of $x$.
[b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often.
[b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often.
[i]Proposed by Johan Meyer, South Africa[/i]
Prove the following inequality.
\[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]
Find the greatest power of $2$ that divides $a_n = [(3+\sqrt{11} )^{2n+1}]$, where $n$ is a given positive integer.