Any natural number $n, n\ge 3$ can be presented in different ways as a sum several summands (not necessarily different). Find the greatest possible value of these summands. Folklore

Let $p> 3$ be a prime number. Determine the number of all ordered sixes $(a, b, c, d, e, f)$ of positive integers whose sum is $3p$ and all fractions $\frac{a + b}{c + d},\frac{b + c}{d + e},\frac{c + d}{e + f},\frac{d + e}{f + a},\frac{e + f}{a + b}$ have integer values.

In an acute-angled triangle $ABC$ the altitudes $AU,BV,CW$ intersect at $H$. Points $X,Y,Z$, different from $H$, are taken on segments $AU,BV$, and $CW$, respectively. (a) Prove that if $X,Y,Z$ and $H$ lie on a circle, then the sum of the areas of triangles $ABZ, AYC, XBC$ equals the area of $ABC$. (b) Prove the converse of (a).

Evaluate the sum $$\sum_{n=0}^\infty\operatorname{arctan}\left(\frac1{1+n+n^2}\right).$$

Let $n$ be a positive integer. Let $G (n)$ be the number of $x_1,..., x_n, y_1,...,y_n \in \{0,1\}$, for which the number $x_1y_1 + x_2y_2 +...+ x_ny_n$ is even, and similarly let $U (n)$ be the number for which this sum is odd. Prove that $$\frac{G(n)}{U(n)}= \frac{2^n + 1}{2^n - 1}.$$

Let $T$ be a real number satisfying the property: For any nonnegative real numbers $a, b, c,d, e$ with their sum equal to $1$, it is possible to arrange them around a circle such that the products of any two neighboring numbers are no greater than $T$. Determine the minimum value of $T$.

a) The numbers $1, 2, . . . , 49$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/5/0/c2e350a6ad0ebb8c728affe0ebb70783baf913.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $36$ numbers, etc., $7$ times. Find the sum of the numbers selected. b) The numbers $1, 2, . . . , k^2$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/2/d/28d60518952c3acddc303e427483211c42cd4a.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $(k - 1)^2$ numbers, etc., $k$ times. Find the sum of the numbers selected.

Prove that the rectangle $m\times n$ table can be filled with exact squares so, that the sums in the rows and the sums in the columns will be exact squares also.

Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when: a) $n=2014$ b) $n=2015 $ c) $n=2018$

If $a_1 \le a_2 \le .. \le a_n$ are natural numbers ($n \ge 2$), show that the inequality $$\sum_{i=1}^n a_ix_i^2 +2\sum_{i=1}^{n-1} x_ix_{i+1} >0$$ holds for all $n$-tuples $(x_1,...,x_n) \ne (0,..., 0)$ of real numbers if and only if $a_2 \ge 2$.

We will call the sequence of positive real numbers. $a_1,a_2,\dots ,a_n$ of [i]length [/i] $n$ when $$a_1\geq \frac{a_1+a_2}{2}\geq \dots \geq \frac{a_1+a_2+\cdots +a_n}{n}.$$ Let $x_1,x_2,\dots ,x_n$ and $y_1,y_2,\dots ,y_n$ be sequences of length $n.$ Prove that $$\sum_{i = 1}^{n}x_iy_i\geq\frac{1}{n}\left(\sum_{i = 1}^{n}x_i\right)\left(\sum_{i = 1}^{n}y_i\right).$$ [i](tatari/nightmare)[/i]

Show that if $x_1+x_2+x_3 = 0$ for real numbers $x_1,x_2,x_3$, then $x_1x_2+x_2x_3+x_3x_1\le 0$. Find all $n \ge 4$ for which $x_1+x_2+...+x_n = 0$ implies $x_1x_2+x_2x_3+...+x_{n-1}x_n+x_nx_1 \le 0$.

Can the set $\{1,2,...,33\}$ be partitioned into $11$ three-element sets, in each of which one element equals the sum of the other two?

Is it possible to partition the set $A = \{1, 2, 3, ... , 32, 33\}$ into eleven subsets that contain three integers each, such that for every one of these eleven subsets, one of the integers is equal to the sum of the other two? If so, give such a partition, if not, prove that such a partition cannot exist.

The vertices of a $33$-gon are labelled with the integers from $1$ to $33$. Each edge is then labelled with the sum of the labels of its two vertices. Is it possible for the edge labels to consist of $33$ consecutive numbers?

Calculate $$\frac{(2^1+3^1)(2^2+3^2)(2^4+3^4)(2^8+3^8)...(2^{2048}+3^{2048})+2^{4096}}{3^{4096}}$$

Let $a_o,a_1,a_2,..,a_ n$ be a non-decreasing sequence of $n+1$ real numbers where $a_0 = 0$ and for every $j > i $ we have $a_j - a_i \le j - i$. Show that $$\left (\sum_{i=0}^n a_i \right )^2 \ge \sum_{i=0}^n a_i^3$$

Do there exist $4$ vectors in the plane so that none is a multiple of another, but the sum of each pair is perpendicular to the sum of the other two? Do there exist $91$ non-zero vectors in the plane such that the sum of any $19$ is perpendicular to the sum of the others?

Find the number of sequences of $2005$ terms with the following properties: (i) No three consecutive terms of the sequence are equal, (ii) Every term equals either $1$ or $-1$, (iii) The sum of all terms of the sequence is at least $666$.

Evaluate the sum $$1 + 2 + 3 - 4 - 5 + 6 + 7 + 8 - 9 - 1 0 + . . . - 2010$$ , where each three consecutive signs $+$ are followed by two signs $-$.

Prove that $$\dfrac{1}{2+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}+\dfrac{1}{1+\dfrac{1}{1+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}}=1$$ This means $1/(2+ (1/(3+ (1/(4+(...+1/1991)))))) +1/(1 + (1/(1 + (1/(3 + (1/(4 + (...+ 1/1991...)))))))) = 1.)$ (G. Galperin, Moscow-Tel Aviv)

Let $A$ and $B$ be two non-empty subsets of $X = \{1, 2, . . . , 8 \}$ with $A \cup B = X$ and $A \cap B = \emptyset$. Let $P_A$ be the product of all elements of $A$ and let $P_B$ be the product of all elements of $B$. Find the minimum possible value of sum $P_A +P_B$. PS. It is a variation of [url=https://artofproblemsolving.com/community/c6h2267998p17621980]JBMO Shortlist 2019 A3 [/url]

Write $102$ as the sum of the largest number of distinct primes.

For $n ,p \in N^*$ , $ 1 \le p \le n$, we define $$ R_n^p = \sum_{k=0}^p (p-k)^n(-1)^k C_{n+1}^k $$ Show that: $R_n^{n-p+1} =R_n^p$ .

* Given several numbers each of which is less than $1951$ and the least common multiple of any two of which is greater than $1951$. Prove that the sum of their reciprocals is less than $2$.