Counting - Permutations and Combinations ​​​​(SOA Exam P - Probability - General Probability Module)

[@janethuffman4]

Props to Jason, this is a great example!

[@android9497]

Great example, I’ve been going through this playlist for review before my p exam and they’ve been helpful, so thanks a bunch

[@analystprep]

Glad it was helpful! If you like our video lessons, it would be appreciated if you could take 2 minutes of your time to leave us a review here: trustpilot.com/review/analystprep.com

[@Pepapig77772]

what a great explanation!, It doesn't matter if you prefer an audio based explanation or a graphic based when you can have both. Greetings from Peru.

[@kai_onlineaaa]

extremely helpful videos !

[@analystprep]

Glad you think so! If you like our video lessons, it would be appreciated if you could take 2 minutes of your time to leave us a review here: trustpilot.com/review/analystprep.com

[@gokhalesadan]

Great example, seems will not forget. Thanks

[@echang29]

College Student studying for Exam P: Thank you so much Professor for this playlist of videos; I've been using them to study. Quick question: Is FCP used for repetitions allowed and order does not matter or repetitions allowed and order does matter or are they the same (there's no difference)? Thank you so much.

[@jeffm.7335]

chatGPT can give you that answer, but to save you some time, use a modified version of the combination formula. For situations where order doesn't matter and repetitions are allowed use: nCk = (n+k-1)! / k!(n-1)!