« Vrati se
Find all positive integers n for which the numbers in the set S = \{1,2, \ldots,n \} can be colored red and blue, with the following condition being satisfied: The set S \times S \times S contains exactly 2007 ordered triples \left(x, y, z\right) such that:

(i) the numbers x, y, z are of the same color,
and
(ii) the number x + y + z is divisible by n.

Author: Gerhard Wöginger, Netherlands

Slični zadaci

Show that for any finite set S of distinct positive integers, we can find a set TS such that every member of T divides the sum of all the members of T.

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 n and k be positive integers such that \frac{1}{2} n < k \leq \frac{2}{3} n. Find the least number m for which it is possible to place m pawns on m squares of an n \times n chessboard so that no column or row contains a block of k adjacent unoccupied squares.
A set of three nonnegative integers \{x,y,z\} with x < y < z is called historic if \{z-y,y-x\} = \{1776,2001\}. Show that the set of all nonnegative integers can be written as the union of pairwise disjoint historic sets.
Let n be a positive integer. A sequence of n positive integers (not necessarily distinct) is called full if it satisfies the following condition: for each positive integer k\geq2, if the number k appears in the sequence then so does the number k-1, and moreover the first occurrence of k-1 comes before the last occurrence of k. For each n, how many full sequences are there ?
Let T be the set of ordered triples (x,y,z), where x,y,z are integers with 0\leq x,y,z\leq9. Players A and B play the following guessing game. Player A chooses a triple (x,y,z) in T, and Player B has to discover A's triple in as few moves as possible. A move consists of the following: B gives A a triple (a,b,c) in T, and A replies by giving B the number \left|x+y-a-b\right |+\left|y+z-b-c\right|+\left|z+x-c-a\right|. Find the minimum number of moves that B needs to be sure of determining A's triple.
Let X be a set of 10,000 integers, none of them is divisible by 47. Prove that there exists a 2007-element subset Y of X such that a - b + c - d + e is not divisible by 47 for any a,b,c,d,e \in Y.

Author: Gerhard Wöginger, Netherlands