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:
65
Step-by-step explanation:
https://www.gktoday.in/aptitude/the-next-number-of-the-sequence-3-5-9-17-33-is/
Answer:
Step-by-step explanation:
Given that transitor has a 2% defective rate, need to calculate the probability that the 10th transistor produced is the first with a defect.
The probability function is p(x=k) = (1-p)^(n-1) * p
p = (1-defective rate)^(n-1) * defective rate; n=10
p = (1-0.02)^9 * 0.02 = 0.98^9 * 0.02 = 0.01666
Since there is a variable, there are infinitely many solutions.
