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.
Solution Comments
Show commentsProblem Recent Solvers18
Suggested Problems
-
Replace NaNs with the number that appears to its left in the row.
2736 Solvers
-
273 Solvers
-
Find the largest value in the 3D matrix
1399 Solvers
-
280 Solvers
-
Sum the numbers on the main diagonal
543 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!