@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.
Find the sum of all the numbers of the input vector
Project Euler: Problem 4, Palindromic numbers
Number of toolboxes?
Sum of first n terms of a harmonic progression
Multiples of a Number in a Given Range
Make an N-dimensional Multiplication Table
Number of 1s in the Binary Representation of a Number
Give the Shortest Path Through The Maze
English to Pig Latin Translator
Project Euler: Problem 16, Sums of Digits of Powers of Two
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office