Found problems: 5802
The sum of the first $n$ terms of the sequence \[1,~(1+2),~(1+2+2^2),~\dots ~(1+2+2^2+\dots +2^{n-1})\] in terms of $n$ is
$\textbf{(A) }2^n\qquad\textbf{(B) }2^n-n\qquad\textbf{(C) }2^{n+1}-n\qquad\textbf{(D) }2^{n+1}-n-2\qquad \textbf{(E) }n\cdot 2^n$
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
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]
Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$.
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has
\[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]
A function $f: \mathbb{R}\to \mathbb{R}$ is [i]essentially increasing[/i] if $f(s)\leq f(t)$ holds whenever $s\leq t$ are real numbers such that $f(s)\neq 0$ and $f(t)\neq 0$.
Find the smallest integer $k$ such that for any 2022 real numbers $x_1,x_2,\ldots , x_{2022},$ there exist $k$ essentially increasing functions $f_1,\ldots, f_k$ such that \[f_1(n) + f_2(n) + \cdots + f_k(n) = x_n\qquad \text{for every } n= 1,2,\ldots 2022.\]
For any natural number $n > 1$ write the finite decimal expansion of $\frac{1}{n}$ (for example we write $\frac{1}{2}=0.4\overline{9}$ as its infinite decimal expansion not $0.5)$. Determine the length of non-periodic part of the (infinite) decimal expansion of $\frac{1}{n}$.
$ A_1 , A_2 , \cdots , A_n $ are given subsets. Let $ S = \left\{ 1, 2, \cdots , n \right\} $. For any $ X \subset S $, let
\[ N(X)= \left\{ i \in S-X \ | \ \forall j \in X, \ A_i \cap A_j \ne \emptyset \right\} \]
Let $ m $ be an integer such that $ 3 \le m \le n-2 $. Prove that there exist $ X \subset S $ such that $ |X|=m $ and $ |N(X)| \ne 1 $.
Consider all non-empty subsets of the set $\{1,2\cdots,n\}$. For every such subset, we find the product of the reciprocals of each of its elements. Denote the sum of all these products as $S_n$. For example,
\[S_3=\frac11+\frac12+\frac13+\frac1{1\cdot 2}+\frac1{1\cdot 3}+\frac1{2\cdot 3} +\frac1{1\cdot 2\cdot 3}\]
[b](i)[/b] Show that $S_n=\frac1n+\left(1+\frac1n\right)S_{n-1}$.
[b](ii)[/b] Hence or otherwise, deduce that $S_n=n$.
A “number triangle” $(t_{n, k}) (0 \le k \le n)$ is defined by $t_{n,0} = t_{n,n} = 1 (n \ge 0),$
\[t_{n+1,m} =(2 -\sqrt{3})^mt_{n,m} +(2 +\sqrt{3})^{n-m+1}t_{n,m-1} \quad (1 \le m \le n)\]
Prove that all $t_{n,m}$ are integers.
Let $n$ be an even natural number and let $A$ be the set of all non-zero sequences of length $n$, consisting of numbers $0$ and $1$ (length $n$ binary sequences, except the zero sequence $(0,0,\ldots,0)$). Prove that $A$ can be partitioned into groups of three elements, so that for every triad $\{(a_1,a_2,\ldots,a_n), (b_1,b_2,\ldots,b_n), (c_1,c_2,\ldots,c_n)\}$, and for every $i = 1, 2,\ldots,n$, exactly zero or two of the numbers $a_i, b_i, c_i$ are equal to $1$.
I'd really appreciate help on this.
(a) Given a set $X$ of points in the plane, let $f_{X}(n)$ be the largest possible area of a polygon with at most $n$ vertices, all of which are points of $X$. Prove that if $m, n$ are integers with $m \geq n > 2$ then $f_{X}(m) + f_{X}(n) \geq f_{X}(m + 1) + f_{X}(n - 1)$.
(b) Let $P_0$ be a $1 \times 2$ rectangle (including its interior) and inductively define the polygon $P_i$ to be the result of folding $P_{i-1}$ over some line that cuts $P_{i-1}$ into two connected parts. The diameter of a polygon $P_i$ is the maximum distance between two points of $P_i$. Determine the smallest possible diameter of $P_{2013}$.
Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins.
(a) Does the game necessarily end?
(b) Does there exist a winning strategy for the starting player?
[i]Proposed by Michael Albert, Richard Guy, New Zealand[/i]
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\]
[i]Proposed by Denmark[/i]
In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that
[b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i];
[b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i].
Find the least possible number of [i]central[/i] vertices in $G$.
For any real numbers sequence $\{x_n\}$ ,suppose that $\{y_n\}$ is a sequence such that:
$y_1=x_1, y_{n+1}=x_{n+1}-(\sum\limits_{i = 1}^{n} {x^2_i})^{ \frac{1}{2}}$ ${(n \ge 1})$ .
Find the smallest positive number $\lambda$ such that for any real numbers sequence $\{x_n\}$ and all positive integers $m$ , have $\frac{1}{m}\sum\limits_{i = 1}^{m} {x^2_i}\le\sum\limits_{i = 1}^{m} {\lambda^{m-i}y^2_i} .$
(High School Affiliated to Nanjing Normal University )
Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$,
\[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]
In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.
Let $ \{a_n\}^{\infty}_1$ be a sequence of real numbers such that $ a_1 \equal{} 2,$ and \[ a_{n\plus{}1} \equal{} a^2_n \minus{} a_n \plus{} 1, \forall n \in \mathbb{N}.\] Prove that \[ 1 \minus{} \frac{1}{2003^{2003}} < \sum^{2003}_{i\equal{}1} \frac{1}{a_i} < 1.\]
The sequence $ a_1<a_2<...<a_M$ of real numbers is called a weak arithmetic progression of length $ M$ if there exists an arithmetic progression $ x_0,x_1,...,x_M$ such that:
$ x_0 \le a_1<x_1 \le a_2<x_2 \le ... \le a_M<x_M.$
$ (a)$ Prove that if $ a_1<a_2<a_3$ then $ (a_1,a_2,a_3)$ is a weak arithmetic progression.
$ (b)$ Prove that any subset of $ \{ 0,1,2,...,999 \}$ with at least $ 730$ elements contains a weak arithmetic progression of length $ 10$.
Let $g:[0,1]\rightarrow \mathbb{R}$ be a continuous function and let $f_{n}:[0,1]\rightarrow \mathbb{R}$ be a
sequence of functions defined by $f_{0}(x)=g(x)$ and
$$f_{n+1}(x)=\frac{1}{x}\int_{0}^{x}f_{n}(t)dt.$$
Determine $\lim_{n\to \infty}f_{n}(x)$ for every $x\in (0,1]$.
Let $k$ and $n$ be positive integers. Consider an array of $2\left(2^n-1\right)$ rows by $k$ columns. A $2$-coloring of the elements of the array is said to be [i]acceptable[/i] if any two columns agree on less than $2^n-1$ entries on the same row.
Given $n$, determine the maximum value of $k$ for an acceptable $2$-coloring to exist.
Suppose a function $f : \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ satisfies $f(f(n)) + f(n+1) = n+2$ for all positive integer $n$. Prove that $f(f(n)+n) = n+1$ for all positive integer $n$.
There are two countries $A$ and $B$, where each countries have $n(\ge 2)$ airports. There are some two-way flights among airports of $A$ and $B$, so that each airport has exactly $3$ flights. There might be multiple flights among two airports; and there are no flights among airports of the same country. A travel agency wants to plan an [i]exotic traveling course[/i] which travels through all $2n$ airports exactly once, and returns to the initial airport. If $N$ denotes the number of all exotic traveling courses, then prove that $\frac{N}{4n}$ is an even integer.
(Here, note that two exotic traveling courses are different if their starting place are different.)
Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square.
[i]Note:[/i] As an example, if $S=\{1,2,4\}$, there are exactly five such ordered pairs: $(1,1)$, $(1,4)$, $(2,2)$, $(4,1)$, and $(4,4)$.
[i]Proposed by Sutanay Bhattacharya[/i]