Adrian can put a total of 1716 combinations in the player.
The formula to be used is as follows:
total combinations = n!/[r! *(n-r)!]
n = number of disks available = 13
r = number of disks that be held = 6
= 13! = (13• 12•11•10•9•8•7•6•5•4•3•2•1)/(6! <span>• 7!)
</span>=1716
Thank you for posting your question. Feel free to ask me more.
Answer:
(A) Because event B rules out obese subjects.
Step-by-step explanation:
(A) is correct because B doesn't have obese people
(B) is incorrect because we don't know if there are obese person but not overweight.
(C) states a correct fact but that portion doesn't relate to event B (overweight but not obese)
Similarly, (D) also states a correct fact but doesn't relate to event B (overweight but not obese)
Answer:
8
Step-by-step explanation:
because 8 dived by 2 = 4, 4+1 =5
Answer:
10
Step-by-step explanation:
Each term is the sum of the two after it:
a_n = a_n+1 + a_n+2
The next term is:
a₄ = a₅ + a₆
31 = 21 + a₆
a₆ = 10