Problem

Source: Iran 2004

Tags: number theory, prime numbers, combinatorics proposed, combinatorics



We say $m \circ n$ for natural m,n $\Longleftrightarrow$ nth number of binary representation of m is 1 or mth number of binary representation of n is 1. and we say $m \bullet n$ if and only if $m,n$ doesn't have the relation $\circ$ We say $A \subset \mathbb{N}$ is golden $\Longleftrightarrow$ $\forall U,V \subset A$ that are finite and arenot empty and $U \cap V = \emptyset$,There exist $z \in A$ that $\forall x \in U,y \in V$ we have $z \circ x ,z \bullet y$ Suppose $\mathbb{P}$ is set of prime numbers.Prove if $\mathbb{P}=P_1 \cup ... \cup P_k$ and $P_i \cap P_j = \emptyset$ then one of $P_1,...,P_k$ is golden.