MathDB
All possible subset S of N

Source: Problem 1 oliforum contest 2009, second round

October 18, 2009
functionalgebra proposedalgebra

Problem Statement

Find all non empty subset S S of \mathbb{N}: \equal{} \{0,1,2,\ldots\} such that 0S 0 \in S and exist two function h():S×SS h(\cdot): S \times S \to S and k():SS k(\cdot): S \to S which respect the following rules: i) k(x) \equal{} h(0,x) for all xS x \in S ii) k(0) \equal{} 0 iii) h(k(x_1),x_2) \equal{} x_1 for all x1,x2S x_1,x_2 \in S. (Pierfrancesco Carlucci)