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 )
Answer:
15,000
Step-by-step explanation:
it is the answer I think.
It is the answer of standard form of 15ten thousand
Answer:

Step-by-step explanation:

Reduce factor by 4

A negative divided by a negative equal positve so

Answer:
Unitary cost= $80
Step-by-step explanation:
Giving the following information:
Total manufacturing cost= $40,000
Number of units= 500
<u>To calculate the unitary cost, we need to use the following formula:</u>
Unitary cost= Total manufacturing cost / number of units
Unitary cost= 40,000 / 500
Unitary cost= $80
Answer:
Step-by-step explanation:
How many 1/4 kg bread loaves can be made from 2½ kg of dough?
2½ / 1/4 = (5/2)•(4/1) = 20 / 2 = 10