A positive integer $m$ is called triangular if $m = 1 + 2 + ... + n$, for an integer $n$. Show that a positive integer $m$ is triangular if and only if $8m + 1$ is the square of an integer.

Let $P$ be a point on the circumcircle of a square $ABCD$. Find all integers $n > 0$ such that the sum $$S_n(P) = |PA|^n + |PB|^n + |PC|^n + |PD|^n$$ is constant with respect to the point $P$.

A Christmas tree must be erected inside a convex rectangular garden and attached to the posts at the corners of the garden with four ropes running at the same height from the ground. At what point should the Christmas tree be placed, so that the sum of the lengths of these four cords is as small as possible?

Answer the following two questions and justify your answers: (a) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+5^{2012}$? (b) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+...+2011^{2012}+2012^{2012}$?

In the plane are $10$ lines in general position, which means that no $2$ are parallel and no $3$ are concurrent. Where $2$ lines intersect, we measure the smaller of the two angles formed between them. What is the maximum value of the sum of the measures of these $45$ angles?

For a given positive integer $n,$ find $$\sum_{k=0}^{n} \left(\frac{\binom{n}{k} \cdot (-1)^k}{(n+1-k)^2} - \frac{(-1)^n}{(k+1)(n+1)}\right).$$

Let $C$ be the circle with center $O(0,0)$ and radius $1$, and $A(1,0), B(0,1)$ be points on the circle. Distinct points $A_1,A_2, ....,A_{n-1}$ on $C$ divide the smaller arc $AB$ into $n$ equal parts ($n \ge 2$). If $P_i$ is the orthogonal projection of $A_i$ on $OA$ ($i =1, ... ,n-1$), find all values of $n$ such that $P_1A^{2p}_1 +P_2A^{2p}_2 +...+P_{n-1}A^{2p}_{n-1}$ is an integer for every positive integer $p$.

Each of the numbers $a_1,...,a_n$ is equal to $1$ or $-1$. If $a_1a_2 + a_2a_3 + ··· + a_{n-1}a_n + a_na_1 = 0$, proves that $n$ is divisible by $4$.

(i) Find a formula for $S_n = -1^2 \times 2 + 2^2 \times 3 - 3^2 \times 4 + 4^2 \times 5 -... + (-l)^n n^2 \times (n + 1)$ in terms of the positive integer $n$. Justify your answer. (As an example, one has $1 + 2 + 3 +...+n = \frac{n(n+1)}{2}$) (ii) Using your formula in (i), find the value of $ -1^2 \times 2 + 2^2 \times 3 - 3^2 \times 4 + 4^2 \times 5 -... + (-l)^{100} 100^2 \times (100 + 1)$

The general term of a sequence of numbers is defined as $a_n =\frac{1}{n^2 - n}$, for every integer $n \ge 3$. That is, $a_3 =\frac16$, $a_4 =\frac{1}{12}$, $a_5 =\frac{1}{20}$, and so on. Find a general expression for the sum $S_n$, which is the sum of all terms from $a_3$ until $a_n$.

Find all points on the plane such that the sum of the distances of each of the four lines defined by the unit square of that plane is $4$.

Let $x = 1 - 2^{-2009}$. Show that $x + x^2 + x^4 + x^8 +... + x^{2^m}< 2010$ for all positive integers $m$.

Let $a_1,a_2,...,a_n$ be $n$ different positive integers where $n\ge 1$. Show that $$\sum_{i=1}^n a_i^3 \ge \left(\sum_{i=1}^n a_i\right)^2$$

Consider a rectangular array of single digits $d_{i,j}$ with 10 rows and 7 columns, such that $d_{i+1,j}-d_{i,j}$ is always 1 or -9 for all $1 \leq i \leq 9$ and all $1 \leq j \leq 7$, as in the example below. For $1 \leq i \leq 10$, let $m_i$ be the median of $d_{i,1}$, ..., $d_{i,7}$. Determine the least and greatest possible values of the mean of $m_1$, $m_2$, ..., $m_{10}$. Example: [img]https://cdn.artofproblemsolving.com/attachments/8/a/b77c0c3aeef14f0f48d02dde830f979eca1afb.png[/img]

Show that there exists a sequence $x_1,x_2,...$ of natural numbers in which every natural number occurs exactly once, such that the sums $\sum_{i=1}^n \frac{1}{x_i}$, $n = 1,2,3,...$, include all natural numbers.

Are there four real numbers $a, b, c, d$ for every three positive real numbers $x, y, z$ with the property $ad + bc = x$, $ac + bd = y$, $ab + cd = z$ and one of the numbers $a, b, c, d$ is equal to the sum of the other three?

Consider a triple $(a, b, c)$ of pairwise distinct positive integers satisfying $a + b + c = 2013$. A step consists of replacing the triple $(x, y, z)$ by the triple $(y + z - x,z + x - y,x + y - z)$. Prove that, starting from the given triple $(a, b,c)$, after $10$ steps we obtain a triple containing at least one negative number.

Find the value of the expression $$f\left( \frac{1}{2000} \right)+f\left( \frac{2}{2000} \right)+...+ f\left( \frac{1999}{2000} \right)+f\left( \frac{2000}{2000} \right)+f\left( \frac{2000}{1999} \right)+...+f\left( \frac{2000}{1} \right)$$ assuming $f(x) =\frac{x^2}{1 + x^2}$ .

The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?

Given $n$ integers $a_1, a_2, ..., a_n$, which $a_1 = 1$ and $a_i \le a_{i + 1} \le 2a_i$ for each $i \in \{1,2,...,n-1\}$ . Prove that if $a_1 + a_2 +... + a_n$ is even, you do select some of the numbers so that their sum equals $\frac{a_1 + a_2 +... + a_n}{2}$ .

a) Prove that if the sum of the non-zero digits $a_1, a_2, ... , a_n$ is a multiple of $27$, then it is possible to permute these digits in order to obtain an $n$-digit number that is a multiple of $27$. b) Prove that if the non-zero digits $a_1, a_2, ... , a_n$ have the property that every ndigit number obtained by permuting these digits is a multiple of $27$, then the sum of these digits is a multiple of $27$

a) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31$ (the product of primes $2$ to $31$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$. b) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 37$ (the product of primes $2$ to $37$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$.

Find the sum of all integers between $-\sqrt {1442}$ and $\sqrt{2020}$.

The numbers $0, 1, 2, . . . , 9$ are written (in some order) on the circumference. Prove that a) there are three consecutive numbers with the sum being at least $15$, b) it is not necessarily the case that there exist three consecutive numbers with the sum more than $15$.

Let $\sum_{n=1}^\infty a_n$ be a convergent series of positive terms (so $a_i>0$ for all $i$) and set $b_n=\frac1{na_n^2}$ for $n\ge1$. Prove that $\sum_{n=1}^\infty\frac n{b_1+b_2+\ldots+b_n}$ is convergent.