Found problems: 5802
Prove that $\frac{1}{1999}< \prod_{i=1}^{999}{\frac{2i-1}{2i}}<\frac{1}{44}$.
Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$.
[i]Proposed by Evan Chen[/i]
Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.
Let $A_1,A_2,...$ be a sequence of sets such that for any positive integer $i$, there are only finitely many values of $j$ such that $A_j\subseteq A_i$. Prove that there is a sequence of positive integers $a_1,a_2,...$ such that for any pair $(i,j)$ to have $a_i\mid a_j\iff A_i\subseteq A_j$.
Determine all primes $p$ such that $5^p + 4 p^4$ is a perfect square, i.e., the square of an integer.
Let ${\left\{ {f(x)} \right\}}$ be a sequence of polynomial, where ${f_0}(x) = 2$, ${f_1}(x) = 3x$, and
${f_n}(x) = 3x{f_{n - 1}}(x) + (1 - x - 2{x^2}){f_{n - 2}}(x)$ $(n \ge 2)$
Determine the value of $n$ such that ${f_n}(x)$ is divisible by $x^3-x^2+x$.
Given an $1$ x $n$ table ($n\geq 2$), two players alternate the moves in which they write the signs + and - in the cells of the table. The first player always writes +, while the second always writes -. It is not allowed for two equal signs to appear in the adjacent cells. The player who can’t make a move loses the game. Which of the players has a winning strategy?
Let $ n $ be a natural number. Find all integer numbers that can be written as
$$ \frac{1}{a_1} +\frac{2}{a_2} +\cdots +\frac{n}{a_n} , $$
where $ a_1,a_2,...,a_n $ are natural numbers.
Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ .
[i]Proposed by Serbia[/i]
Let $$a_n = \frac{1\cdot3\cdot5\cdot\cdots\cdot(2n-1)}{2\cdot4\cdot6\cdot\cdots\cdot2n}.$$
(a) Prove that $\lim_{n\to \infty}a_n$ exists.
(b) Show that $$a_n = \frac{\left(1-\frac1{2^2}\right)\left(1-\frac1{4^2}\right)\left(1-\frac1{6^2}\right)\cdots\left(1-\frac{1}{(2n)^2}\right)}{(2n+1)a_n}.$$
(c) Find $\lim_{n\to\infty}a_n$ and justify your answer
Define a sequence of polynomials $P_0\left(x\right)=x$ and $P_k\left(x\right)=P_{k-1}\left(x\right)^2-\left(-1\right)^kk$ for each $k\geq1$. Also define $Q_0\left(x\right)=x$ and $Q_k\left(x\right)=Q_{k-1}\left(x\right)^2+\left(-1\right)^kk$ for each $k\geq1$. Compute the product of the distinct real roots of \[P_1\left(x\right)Q_1\left(x\right)P_2\left(x\right)Q_2\left(x\right)\cdots P_{2018}\left(x\right)Q_{2018}\left(x\right).\]
[i]2018 CCA Math Bonanza Tiebreaker Round #2[/i]
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
Let $n$ be a positive integer, prove that :
[b](a)[/b] $\log_{10}(n + 1) > \frac{3}{10n} +\log_{10}n ;$
[b](b)[/b] $ \log n! > \frac{3n}{10}\left( \frac 12+\frac 13 +\cdots +\frac 1n -1\right).$
For all $n>1$. Find all polynomials with complex coefficient and degree more than one such that $(p(x)-x)^2$ divides $p^n(x)-x$. ($p^0(x)=x , p^i(x)=p(p^{i-1}(x))$)
[i]Proposed by Navid Safaie[/i]
Prove that for any positive integer $n\ge $, $2 \cdot \sqrt3 \cdot \sqrt[3]{4} ...\sqrt[n-1]{n} > n$
Two symbols $A$ and $B$ obey the rule $ABBB = B$. Given a word $x_1x_2\ldots x_{3n+1}$ consisting of $n$ letters $A$ and $2n+1$ letters $B$, show that there is a unique cyclic permutation of this word which reduces to $B$.
Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer.
Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers.
[i]Proposed by Matthew Babbitt[/i]
Let $a_1$ be any positive integer. For all $i$, write $5^{2020}$ times $a_i$ in base $10$, replace each digit with its remainder when divided by $2$, read off the result in binary, and call that $a_{i+1}$. Prove that $a_N = a_{N+2^{2020}}$ for all sufficiently large $N$.
Consider an integer \(n \ge 2\) and write the numbers \(1, 2, \ldots, n\) down on a board. A move consists in erasing any two numbers \(a\) and \(b\), then writing down the numbers \(a+b\) and \(\vert a-b \vert\) on the board, and then removing repetitions (e.g., if the board contained the numbers \(2, 5, 7, 8\), then one could choose the numbers \(a = 5\) and \(b = 7\), obtaining the board with numbers \(2, 8, 12\)). For all integers \(n \ge 2\), determine whether it is possible to be left with exactly two numbers on the board after a finite number of moves.
[i]Proposed by China[/i]
Some language has only three letters - $A, B$ and $C$. A sequence of letters is called a word iff it contains exactly 100 letters such that exactly 40 of them are consonants and other 60 letters are all $A$. What is the maximum numbers of words one can pick such that any two picked words have at least one position where they both have consonants, but different consonants?
Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition
\[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1
\]
for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$
[i]Author: Nikolai Nikolov, Bulgaria[/i]
Let $A$ be an $n\times n$ complex matrix such that $A \ne \lambda I_{n}$ for all $\lambda \in \mathbb{C}$. Prove that $A$ is similar to a matrix having at most one non-zero entry on the maindiagonal.
What is the value of $1+3+5+\cdots+2017+2019-2-4-6-\cdots-2016-2018$?
$\textbf{(A) }-1010\qquad\textbf{(B) }-1009\qquad\textbf{(C) }1008\qquad\textbf{(D) }1009\qquad \textbf{(E) }1010$
At a certain mathematical conference, every pair of mathematicians are either friends or strangers. At mealtime, every participant eats in one of two large dining rooms. Each mathematician insists upon eating in a room which contains an even number of his or her friends. Prove that the number of ways that the mathematicians may be split between the two rooms is a power of two (i.e., is of the form $ 2^k$ for some positive integer $ k$).
Prove that there exists an infinite sequence of positive integers $a_1,a_2,a_3,\dots$ such that for any positive integer $k$, $a_k^2+a_k+2023$ has at least $k$ distinct positive divisors.