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:
262 in
Step-by-step explanation:
the equation for volume of a sphere is : 
r
so replacing the number of the radius into the equation, it would look like:
r
which gives you 523.59878 in
but since it's a hemisphere, you'd divide it in half, which gives you 261.79939.
since you're rounding off to the nearest whole number, you're answer is 262 in
Answer:
equal -1 plus 1 equals what
Answer:
5.8
Step-by-step explanation:
the distance formula is
d =sqrt( (x2-x1)^2 + (y2-y1)^2 )
= sqrt ( (-5 - -2) ^2 + (-1 - -6)^2 )
= sqrt( (-5 +2) ^2 + (-1 +6)^2 )
= sqrt( (-3) ^2 + (5)^2 )
= sqrt( 9+25)
= sqrt(34)
=5.830951895
Rounding to the nearest tenth
5.8
Answer:
5/36
Step-by-step explanation:
We need the least common denominator for 12 and 9.
12 = 2^2 * 3
9 = 3^2
LCD = 2^2 * 3^2 = 4 * 9 = 36
11/12 - 7/9 = 33/36 - 28/36 = 5/36
