Find all positive integers
for which the numbers in the set
can be colored red and blue, with the following condition being satisfied: The set
contains exactly
ordered triples
such that:
(i) the numbers
,
,
are of the same color,
and
(ii) the number
is divisible by
.
Author: Gerhard Wöginger, Netherlands





(i) the numbers



and
(ii) the number


Author: Gerhard Wöginger, Netherlands
Slični zadaci
Show that for any finite set
of distinct positive integers, we can find a set
⊇
such that every member of
divides the sum of all the members of
.
Original Statement:
A finite set of (distinct) positive integers is called a DS-set if each of the integers divides the sum of them all. Prove that every finite set of positive integers is a subset of some DS-set.





Original Statement:
A finite set of (distinct) positive integers is called a DS-set if each of the integers divides the sum of them all. Prove that every finite set of positive integers is a subset of some DS-set.
Let
be a positive integer. A sequence of
positive integers (not necessarily distinct) is called full if it satisfies the following condition: for each positive integer
, if the number
appears in the sequence then so does the number
, and moreover the first occurrence of
comes before the last occurrence of
. For each
, how many full sequences are there ?








Let
be the set of ordered triples
, where
are integers with
. Players
and
play the following guessing game. Player
chooses a triple
in
, and Player
has to discover
's triple in as few moves as possible. A move consists of the following:
gives
a triple
in
, and
replies by giving
the number
. Find the minimum number of moves that
needs to be sure of determining
's triple.



















