A set of balls contains
balls which are labeled with numbers
. We are given
such sets. We want to colour the balls with two colours, black and white in such a way, that
(a) the balls labeled with the same number are of the same colour,
(b) any subset of
balls with (not necessarily different) labels
satisfying the condition
, contains at least one ball of each colour.
Find, depending on
the greatest possible number
which admits such a colouring.



(a) the balls labeled with the same number are of the same colour,
(b) any subset of



Find, depending on


A tetrahedron is called a MEMO-tetrahedron if all six sidelengths are different positive integers where one of them is
and one of them is
. Let
be the sum of the sidelengths of the tetrahedron
.
(a) Find all positive integers
so that there exists a MEMO-Tetrahedron
with
.
(b) How many pairwise non-congruent MEMO-tetrahedrons
satisfying
exist? Two tetrahedrons are said to be non-congruent if one cannot be obtained from the other by a composition of reflections in planes, translations and rotations. (It is not neccessary to prove that the tetrahedrons are not degenerate, i.e. that they have a positive volume).




(a) Find all positive integers



(b) How many pairwise non-congruent MEMO-tetrahedrons

