discrete math
Posted: Wed May 11, 2022 6:36 am
discrete math
Let P H has n be a 88 element set and suppose that the set elements. What is the largest value for n that will guarantee that for any mapping f:P-H there is always at least one element from H which is the image (under f) of at least 10 elements from P?
- Discrete Math 1 (28.58 KiB) Viewed 30 times