Some distinct positive integers were written on a blackboard such that the sum of any two integers is a power of $2$. What is the maximal possible number written on the blackboard?

Consider the set $S = \{1,2,3, ...,1441\}$. 1. Nora counts thoses subsets of $S$ having exactly two elements, tbe sum of which is even. Rania counts those subsets of $S$ having exactly two elements, the sum of which is odd. Determine the numbers counted by Nora and Rania. 2. Let $t$ be the number of subsets of $S$ which have at least two elements and the product of the elements is even. Determine the greatest power of $2$ which divides $t$. 3. Ahmad counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is even. Bushra counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is odd. Whose number is bigger? Determine the difference between the numbers found by Ahmad and Bushra.

In the numerical triangle $................1..............$ $...........1 ...1 ...1.........$ $......1... 2... 3 ... 2 ... 1....$ $.1...3...6...7...6...3...1$ $...............................$ each number is equal to the sum of the three nearest to it numbers from the row above it; if the number is at the beginning or at the end of a row then it is equal to the sum of its two nearest numbers or just to the nearest number above it (the lacking numbers above the given one are assumed to be zeros). Prove that each row, starting with the third one, contains an even number.

For a given integer $n \ge 4$ we examine whether there exists a table with three rows and $n$ columns which can be filled by the numbers $1, 2,...,, 3n$ such that $\bullet$ each row totals to the same sum $z$ and $\bullet$ each column totals to the same sum $s$. Prove: (a) If $n$ is even, such a table does not exist. (b) If $n = 5$, such a table does exist. (Gerhard J. Woeginger)

Five numbers are chosen from $\{1, 2, \ldots, n\}$. Determine the largest $n$ such that we can always pick some of the 5 chosen numbers so that they can be made into two groups whose numbers have the same sum (a group may contain only one number).

Define the [i]distance [/i] between two $5$-digit numbers $\overline{a_1a_2a_3a_4a_5}$ and $\overline{b_1b_2b_3b_4b_5}$ to be the largest integer $j$ such that $a_j \ne b_j$ . (Example: the distance between $16523$ and $16452$ is $5$.) Suppose all $5$-digit numbers are written in a line in some order. What is the minimal possible sum of the distances of adjacent numbers in that written order?

Let $x, y$ and $z$ be real numbers such that $x + y + z = 0$. Show that $x^3 + y^3 + z^3 = 3xyz$.

Find all possible values of $n \ge 1$ for which there exist $n$ consecutive positive integers whose sum is a prime number.

Call a positive integer [i]lonely [/i] if the sum of reciprocals of its divisors (including $1$ and the integer itself) is not equal to the sum of reciprocals of divisors of any other positive integer. Prove that a) all primes are lonely, b) there exist infinitely many non-lonely positive integers.

A $3\times 3$ table is filled with real numbers in such a way that each number in the table is equal to the absolute value of the difference of the sum of numbers in its row and the sum of numbers in its column. (a) Show that any number in this table can be expressed as a sum or a difference of some two numbers in the table. (b) Show that there is such a table not all of whose entries are $0$.

Consider the real numbers $a_1,a_2,...,a_{2n}$ whose sum is equal to $0$. Prove that among pairs $(a_i,a_j) , i<j$ where $ i,j \in \{1,2,...,2n\} $ .there are at least $2n-1$ pairs with the property that $a_i+a_j\ge 0$.

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

Real nonzero numbers $x, y, z$ are such that $x+y +z = 0$. Moreover, it is known that $$A =\frac{x}{y}+\frac{y}{z}+\frac{z}{x}=\frac{x}{z}+\frac{z}{y}+\frac{y}{x}+ 1$$Determine $A$.

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.

$\{a_n\}$ is a positive integer sequence such that $a_{i+2} = a_{i+1} +a_i$ (for all $i \ge 1$). For positive integer $n$, define as $$b_n=\frac{1}{a_{2n+1}}\Sigma_{i=1}^{4n-2}a_i$$ Prove that $b_n$ is positive integer.

Find the minimum value of $n$ such that, among any $n$ integers, there are three whose sum is divisible by $3$.

Let $a, b$ be positive real numbers satisfying $a + b = 1$. Show that if $x_1,x_2,...,x_5$ are positive real numbers such that $x_1x_2...x_5 = 1$, then $(ax_1+b)(ax_2+b)...(ax_5+b)>1$

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Product of two integers is $1$ less than three times of their sum. Find those integers.