Problem 628. Book Club
Solution Stats
Problem Comments
-
4 Comments
@bmtran, could you please specify the problem to a greater detail? Are there any constraints such as: each member should read at least one book? Do permutations of who reads which book matter? Cheers, VL.
Same for me... i'm not sure if I understand the problem correctly... If my combinatorics is right, the solution should simply be factorial(k)/factorial(k-n) but apparently this is not the case... I assume I'm misinterpreting something???
sorry if i wasn't clear enough. i'm revising my question to be more specific now
Mathematical Reformulation: How many K-letter words can be formed using N-letters if repetition of letters is allowed and each letter appears at least once?....Hint: A closed form solution exist aside the brute force solutions.
Problem Recent Solvers18
Suggested Problems
-
6692 Solvers
-
3127 Solvers
-
Back to basics 11 - Max Integer
750 Solvers
-
364 Solvers
-
Vector Linear sum: (p1-m1)V1+(p2-m2)V2+...(pK-mk)Vk
51 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!