Answer:
x>1
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 )
180-115=65 (just writing this because my answer has to be over 20 characters)
Answer:
Question 11 is correct (7.9).
Question 12 is not 8.3, it is 9.6.
Step-by-step explanation:
Answer:
The least common denominator is 6.
Step-by-step explanation: