- #1

laminatedevildoll

- 211

- 0

For instance,

If X={1,2,3}

How do I find at least three different choice function c:P(X)--->X?

Is the number of different choice functions in {c:P(X)--->X} 7 since it is without the empty set?

I'd be very grateful for any feedback.