MathCastle
Proof WritingChallengeExistence, Uniqueness and Counterexamples

Existence, Uniqueness and Counterexamples · Challenge problem

How many functions f:{1,2,3,4}→{1,2,3,4}f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} make this statement true: "for every xx there is a y≠xy \ne x with f(y)≥f(x)f(y) \ge f(x)"?