A Parity Pairing Function

Problem

For a given positive integer nn (n⩾2n \geqslant 2), let M={k∈Z∣−n⩽k⩽n}M = \{k \in \mathbb{Z} \mid -n \leqslant k \leqslant n\}. Nonempty sets A,BA, B satisfy A∪B=MA \cup B = M and A∩B=∅A \cap B = \varnothing. Suppose that for every x∈Ax \in A there is a unique y∈By \in B such that x+yx + y is even; write y=p(x)y = p(x) and call p ⁣:A→Bp \colon A \to B a PP-function from AA to BB.

1. For n=3n = 3 and A={−3,−1,1,3}A = \{-3, -1, 1, 3\}, write down BB, and decide whether a PP-function from AA to BB exists; explain. 2. If AA contains at least one odd number and p ⁣:A→Bp \colon A \to B is a PP-function, prove that there exists x∈Ax \in A with p(x)=−xp(x) = -x. 3. If p ⁣:A→Bp \colon A \to B is a PP-function such that p(x)⩾xp(x) \geqslant x for all x∈Ax \in A, find all possible sets AA.

Answer

Solution

Difficulty8/10
Topicscombinatorics, functions, Logic, Set Theory, Casework

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.