- Discrete Math 1 (28.58 KiB) Viewed 28 times
discrete math
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
discrete math
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?
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?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!