This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 119

If $b_k \geq a_k \geq 0$ $(k = 1, 2, 3)$ and $\alpha \geq 1$ then$$(\alpha+3)\sum \limits_{cyc}(b_1-a_1)\left((b_2+b_3)^{\alpha+2}+(a_2+a_3)^{\alpha+2}-(a_2+b_3)^{\alpha+1}-(b_2+a_3)^{\alpha+1}\right)$$ $$\leq (\alpha+2)(\alpha+3)\sum \limits_{cyc}(b_1-a_1)(b_2-a_2)(b_3^{\alpha+1}-a_3^{\alpha+1})$$ $$+ (b_3 + b_2 + a_1)^{\alpha+3}+(b_3 + a_2 + a_1)^{\alpha+3}+(a_3 + b_2 + a_1)^{\alpha+3}+(a_3 + a_2 + b_1)^{\alpha+3}$$ $$-(b_3 + b_2 + b_1)^{\alpha+3}-(b_3 + a_2 + a_1)^{\alpha+3}-(a_3 + b_2 + b_1)^{\alpha+3}-(a_3 + a_2 + a_1)^{\alpha+3}$$
The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$. [i]Proposed by Mariusz Skalba, Poland[/i]
Let $a_1,a_2,\dots$ and $b_1,b_2,\dots$ be sequences of positive real numbers such that $a_1=b_1=1$ and $b_n=b_{n-1}a_n-2$ for $n=2,3,\dots.$ Assume that the sequence $(b_j)$ is bounded. Prove that \[S=\sum_{n=1}^{\infty}\frac1{a_1\cdots a_n}\] converges, and evaluate $S.$
Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$
Let $x_i$, $y_i$, $z_i$, $w_i \in \mathbb{R}^+, i = 1, 2,\cdots n$, such that$$\sum \limits_{i=1}^nx_i=nx,\ \sum \limits_{i=1}^ny_i=ny,\ \sum \limits_{i=1}^nw_i=nw $$ $$\Gamma \left(z_i\right)\geq \Gamma \left(w_i\right),\ \sum \limits_{i=1}^n\Gamma \left(z_i\right)=n\Gamma^* (z)$$Then$$\sum \limits_{i=1}^n \frac{\left(\Gamma \left(x_i\right)+\Gamma \left(y_i\right)\right)^2}{\Gamma \left(z_i\right)-\Gamma \left(w_i\right)}\geq n\frac{\left(\Gamma \left(x\right)+\Gamma \left(y\right)\right)^2}{\Gamma^* \left(z\right)-\Gamma \left(w\right)}$$
$\frac1{1+\sqrt3}+\frac1{\sqrt3+\sqrt5}+\frac1{\sqrt5+\sqrt7}+\ldots+\frac1{\sqrt{2017}+\sqrt{2019}}=?$ $\textbf{(A)}~\frac{\sqrt{2019}-1}2$ $\textbf{(B)}~\frac{\sqrt{2019}+1}2$ $\textbf{(C)}~\frac{\sqrt{2019}-1}4$ $\textbf{(D)}~\text{None of the above}$
For positive real $x$, let $$B_n(x)=1^x+2^x+\ldots+n^x.$$Prove or disprove the convergence of $$\sum_{n=2}^\infty\frac{B_n(\log_n2)}{(n\log_2n)^2}.$$
Calculate the exact value of the series $\sum _{n=2} ^\infty \log (n^3 +1) - \log (n^3 - 1)$ and provide justification.
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?
For positive integers $j\le n$, prove that $$\sum_{k=j}^n\binom{2n}{2k}\binom kj=\frac{n\cdot4^{n-j}}j\binom{2n-j-1}{j-1}.$$ [i]Proposed by Ángel Plaza[/i]
The number $n$ is called a composite number if it can be written in the form $n = a\times b$, where $a, b$ are positive integers greater than $1$. Write number $2013$ in a sum of $m$ composite numbers. What is the largest value of $m$? (A): $500$, (B): $501$, (C): $502$, (D): $503$, (E): None of the above.
How many finite sequances $x_1,x_2,\cdots,x_m$ are there such that $x_i=1$ or 2 and $\sum \limits_{i=1}^mx_i=10$ ? [list=1] [*] 89 [*] 73 [*] 107 [*] 119 [/list]
Let $n$ be a positive integer. Also let $a_1, a_2, \dots, a_n$ and $b_1,b_2,\dots, b_n$ be real numbers such that $a_i+b_i>0$ for $i=1,2,\dots, n$. Prove that $$\sum_{i=1}^n \frac{a_ib_i-b_i^2}{a_i+b_i}\le\frac{\displaystyle \sum_{i=1}^n a_i\cdot \sum_{i=1}^n b_i - \left( \sum_{i=1}^n b_i\right) ^2}{\displaystyle\sum_{i=1}^n (a_i+b_i)}$$. (Proposed by Daniel Strzelecki, Nicolaus Copernicus University in Toruń, Poland)
Find the greatest integer less than or equal to $\sum_{k=1}^{2^{1983}} k^{\frac{1}{1983} -1}.$
Let $a_n>0$, $n\ge1$. Consider the right triangles $\triangle A_0A_1A_2$, $\triangle A_0A_2A_3,\ldots$, $\triangle A_0A_{n-1}A_n,\ldots,$ as in the figure. (More precisely, for every $n\ge2$ the hypotenuse $A_0A_n$ of $\triangle A_0A_{n-1}A_n$ is a leg of $\triangle A_0A_nA_{n+1}$ with right angle $\angle A_0A_nA_{n+1}$, and the vertices $A_{n-1}$ and $A_{n+1}$ lie on the opposite sides of the straight line $A_0A_n$; also, $|A_{n-1}A_n|=a_n$ for every $n\ge1$.) [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYi8yL2M1ZjAxM2I1ZWU0N2E4MzQyYWIzNmQ5OGM3NjJlZjljODdmMTliLnBuZw==&rn=U0VFTU9VUyAyMDEyLnBuZw==[/img] Is it possible for the set of points $\{A_n\mid n\ge0\}$ to be unbounded but the series $\sum_{n=2}^\infty m\angle A_{n-1}A_0A_n$ to be convergent? [i]Note.[/i] A subset $B$ of the plane is bounded if and only if there is a disk $D$ such that $B\subseteq D$.
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]
Let $0 < \frac{1}{q} \leq \frac{1}{p} < 1$ and $\frac{1}{p}+\frac{1}{q}=1$. Let $u_k$, $v_k$, $a_k$ and $b_k$ be non-negative real sequences such as $u^2_k > a^p_k$ and $v_k > b^q_k$, where $k = 1, 2,\cdots , n$. If $0 < m_1\leq u_k \leq M_1$ and $0 < m_2 \leq v_k \leq M_2$ , then $$\left(\sum \limits_{k=1}^n\left(l^p\left(u_k+v_k\right)^2-\left(a_k+b_k\right)^p\right)\right)^{\frac{1}{p}}\geq \left(\sum \limits_{k=1}^n\left(u_k^2-a_k^p\right)\right)^{\frac{1}{p}}\left(\sum \limits_{k=1}^n\left(v_k^2-b_k^p\right)\right)^{\frac{1}{p}}$$where $$l=\frac{M_1M_2+m_1m_2}{2\sqrt{m_1M_1m_2M_2}}$$
Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$
Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$
Prove that the series $\sum_p c_p f(px)$, where the summation is over all primes, unconditionally converges in $L^2[0,1]$ for every $1$-periodic function $f$ whose restriction to $[0,1]$ is in $L^2[0,1]$ if and only if $\sum_p |c_p|<\infty$. ([i]Unconditional convergence[/i] means convergence for all rearrangements.) [G. Halasz]
Let $n$ be an integer greater than $1$. Let $x\in\mathbb R$. (a) Evaluate $S(x,n)=\sum(x+p)(x+q)$, where the summation is over all pairs $(p,q)$ of different numbers from $\{1,2,\ldots,n\}$. (b) Do there exist integers $x,n$ for which $S(x,n)=0$?
Let $k$ and $n$ be positive integers and let $$S=\{(a_1,\ldots,a_k)\in \mathbb{Z}^{k}\;|\; 0\leq a_k\leq\cdots\leq a_1 \leq n,a_1+\cdots+a_k=n\}$$. Determine, with proof, the value of $$\sum_{(a_1,\ldots,a_k)\in S}\binom{n}{a_1}\binom{a_1}{a_2}\cdots\binom{a_{k-1}}{a_k}$$ in terms of $k$ and $n$, where the sum is over all $k$-tuples in $S$.
Let $n$ and $k$ be positive integers. Evaluate the following sum $$\sum_{j=0}^k\binom kj^2\binom{n+2k-j}{2k}$$where $\binom nk=\frac{n!}{k!(n-k)!}$.
Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.
Find $$\lim_{n\to \infty} \frac{1}{n^5 } \sum_{h=1}^{n} \sum_{k=1}^{n} (5h^4 -18h^2 k^2 +5k^4).$$