@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.
Solve the set of simultaneous linear equations
284 Solvers
334 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
342 Solvers
Create a Multiplication table matrix...
290 Solvers
Fahrenheit to Celsius converter
372 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!