Consider a prism with triangular base. The total area of the three faces containing a particular vertex $A$ is $K$. Show that the maximum possible volume of the prism is $\sqrt{\frac{K^3}{54}}$ and find the height of this largest prism.

Let $N$ be a positive integer. It is given set of weights which satisfies following conditions: $i)$ Every weight from set has some weight from $1,2,...,N$; $ii)$ For every $i\in {1,2,...,N}$ in given set there exists weight $i$; $iii)$ Sum of all weights from given set is even positive integer. Prove that set can be partitioned into two disjoint sets which have equal weight

Let $n>1$ be a given positive integer. Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $n$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $n$ loses. Who wins if every player wants to win? Find answer for each $n>1$. [i]Proposed by Mykhailo Shtandenko, Anton Trygub[/i]

Let $\omega=\cos\frac{2\pi}{7}+i\cdot\sin\frac{2\pi}{7}$, where $i=\sqrt{-1}$. Find $$\prod_{k=0}^{6}(\omega^{3k}+\omega^k+1).$$

There are $1999$ people participating in an exhibition. Among any $50$ people there are two who don't know each other. Prove that there are $41$ people, each of whom knows at most $1958$ people.

Let $(G,\cdot)$ be a finite group with the identity element, $e$. The smallest positive integer $n$ with the property that $x^{n}= e$, for all $x \in G$, is called the [i]exponent[/i] of $G$. (a) For all primes $p \geq 3$, prove that the multiplicative group $\mathcal G_{p}$ of the matrices of the form $\begin{pmatrix}\hat 1 & \hat a & \hat b \\ \hat 0 & \hat 1 & \hat c \\ \hat 0 & \hat 0 & \hat 1 \end{pmatrix}$, with $\hat a, \hat b, \hat c \in \mathbb Z \slash p \mathbb Z$, is not commutative and has [i]exponent[/i] $p$. (b) Prove that if $\left( G, \circ \right)$ and $\left( H, \bullet \right)$ are finite groups of [i]exponents[/i] $m$ and $n$, respectively, then the group $\left( G \times H, \odot \right)$ with the operation given by $(g,h) \odot \left( g^\prime, h^\prime \right) = \left( g \circ g^\prime, h \bullet h^\prime \right)$, for all $\left( g,h \right), \, \left( g^\prime, h^\prime \right) \in G \times H$, has the [i]exponent[/i] equal to $\textrm{lcm}(m,n)$. (c) Prove that any $n \geq 3$ is the [i]exponent[/i] of a finite, non-commutative group. [i]Ion Savu[/i]

[b] Problem Section #3 NOTE: Neglect that HF and CD.

We are given a rectangular table with a positive integer written in each of its cells. For each cell of the table, the number in it is equal to the total number of different values in the cells that are in the same row or column (including itself). Find all tables with this property.

In the sequence of integers $(a_n)$, the sum $a_m + a_n$ is divided by $m + n$ with any different $m$ and $n$. Prove that $a_n$ is a multiple of $n$ for any $n$.

Let $S$ be a subset of the set $\{1, 2, 3, \dots, 2015\}$ such that for any two elements $a, b \in S$, the difference $a - b$ does not divide the sum $a + b$. Find the maximum possible size of $S$.

An acute triangle $ ABC$ has three heights $ AD, BE$ and $ CF$ respectively. Prove that the perimeter of triangle $ DEF$ is not over half of the perimeter of triangle $ ABC.$

On a \( 10 \times 10 \) chessboard, there are 91 white pawns placed in different squares. Nico picks a white pawn, paints it black, and places it in an empty square, repeating the process until all pawns have been painted. Prove that at some point, there will be two pawns of different colors placed on squares that share a common edge.

Let $ABC$ be an acute-angled triangle with circumcenter $O$ and let $M$ be a point on $AB$. The circumcircle of $AMO$ intersects $AC$ a second time on $K$ and the circumcircle of $BOM$ intersects $BC$ a second time on $N$. Prove that $\left[MNK\right] \geq \frac{\left[ABC\right]}{4}$ and determine the equality case.

Kelvin the Frog and $10$ of his relatives are at a party. Every pair of frogs is either [i]friendly[/i] or [i]unfriendly[/i]. When $3$ pairwise friendly frogs meet up, they will gossip about one another and end up in a [i]fight[/i] (but stay [i]friendly[/i] anyway). When $3$ pairwise unfriendly frogs meet up, they will also end up in a [i]fight[/i]. In all other cases, common ground is found and there is no fight. If all $\binom{11}{3}$ triples of frogs meet up exactly once, what is the minimum possible number of fights?

Let $S$ be the set of all the odd positive integers that are not multiples of $5$ and that are less than $30m$, $m$ being an arbitrary positive integer. What is the smallest integer $k$ such that in any subset of $k$ integers from $S$ there must be two different integers, one of which divides the other?

$a,b,c\in\mathbb{R^+}$ and $a^2+b^2+c^2=48$. Prove that \[a^2\sqrt{2b^3+16}+b^2\sqrt{2c^3+16}+c^2\sqrt{2a^3+16}\le24^2\]