Find with proof the minimum possible k such that every subset of f1; 2; : : : ; 2022g of size k must contain at least two elemen
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
1. Given, u = 20 , x = 4 , y = 7 , z = 10
⇒
⇒
⇒
⇒
⇒
⇒
⇒
2.
Multiplying or dividing a positive integer by any negative integer gives a negative integer
= - 8
3.
⇒
⇒
⇒
Hope I helped!
Best regards! :D