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 $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]

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 $f$ be a function satisfying $f(x+y+z)=f(x)+f(y)+f(z)$ for all integers $x$, $y$, $z$. Suppose $f(1)=1$, $f(2)=2$. Then $\lim \limits_{n\to \infty} \frac{1}{n^3} \sum \limits_{r=1}^n 4rf(3r)$ equals [list=1] [*] 4 [*] 6 [*] 12 [*] 24 [/list]

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$.

Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$

For each integer $ n\geq 2 $, let $ S_n $ be the sum of all products $ jk $, where $ j $ and $ k $ are integers and $ 1\leq j<k\leq n $. What is the sum of the 10 least values of $ n $ such that $ S_n $ is divisible by $ 3 $? $\textbf{(A) }196\qquad\textbf{(B) }197\qquad\textbf{(C) }198\qquad\textbf{(D) }199\qquad\textbf{(E) }200$

For a permutation $\pi$ of $\{1,2,3,\ldots,n\}$, let $\text{Inv}(\pi)$ be the number of pairs $(i,j)$ with $1 \leq i < j \leq n$ and $\pi(i) > \pi(j)$. [list=1] [*] Given $n$, what is $\sum \text{Inv}(\pi)$ where the sum ranges over all permutations $\pi$ of $\{1,2,3,\ldots,n\}$? [*] Given $n$, what is $\sum \left(\text{Inv}(\pi)\right)^2$ where the sum ranges over all permutations $\pi$ of $\{1,2,3,\ldots,n\}$?[/list] [i]Brian Hamrick.[/i]

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)!}$.

[list=1] [*] Prove that $$\lim \limits_{n \to \infty} \left(n+\frac{1}{4}-\zeta(3)-\zeta(5)-\cdots -\zeta(2n+1)\right)=0$$ [*] Calculate $$\sum \limits_{n=1}^{\infty} \left(n+\frac{1}{4}-\zeta(3)-\zeta(5)-\cdots -\zeta(2n+1)\right)$$ [/list]

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

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)

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 that for any prime $p\ge5$, the number $$\sum_{0<k<\frac{2p}3}\binom pk$$is divisible by $p^2$.

Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

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?

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 $n$ be the product of the first $10$ primes, and let $$S=\sum_{xy\mid n} \varphi(x) \cdot y,$$ where $\varphi(x)$ denotes the number of positive integers less than or equal to $x$ that are relatively prime to $x$, and the sum is taken over ordered pairs $(x, y)$ of positive integers for which $xy$ divides $n$. Compute $\tfrac{S}{n}.$

Prove that $$\sum_{k=0}^\infty x^k\frac{1+x^{2k+2}}{(1-x^{2k+2})^2}=\sum_{k=0}^\infty(-1)^k\frac{x^k}{(1-x^{k+1})^2}$$for all $x\in(-1,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$.

Let $p>5$ be a prime number. For any integer $x$, define \[{f_p}(x) = \sum_{k=1}^{p-1} \frac{1}{(px+k)^2}\] Prove that for any pair of positive integers $x$, $y$, the numerator of $f_p(x) - f_p(y)$, when written as a fraction in lowest terms, is divisible by $p^3$.

Find the value of \[\sum_{a = 1}^{\infty} \sum_{b = 1}^{\infty} \sum_{c = 1}^{\infty} \frac{ab(3a + c)}{4^{a+b+c} (a+b)(b+c)(c+a)}.\]

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}.$$

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}.$

There are $\tfrac{n(n+1)}{2}$ distinct sums of two distinct numbers, if there are $n$ numbers. For which $n \ (n \geq 3)$ do there exist $n$ distinct integers, such that those sums are $\tfrac{n(n-1)}{2}$ consecutive numbers?