Answer:
a
Step-by-step explanation:
Complete question is;
Given n objects are arranged in a row. A subset of these objects is called unfriendly, if no two of its elements are consecutive. Show that the number of unfriendly subsets of a k-element set is ( n−k+1 )
( k )
Answer:
I've been able to prove that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
Step-by-step explanation:
I've attached the proof that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
This should be distributive property
Answer:
<u>x = 5</u>
Step-by-step explanation:
Both angles add to 180, so by knowing that we can say...
16x - 5 + -5 + 22x = 180
Now simplify and solve
38x - 10 = 180
38x = 190
<u>x = 5</u>