nice (and difficult) problem! (if possible, please fix the testsuite adding something along the lines of "assert(n==numel(unique(c)))")
example of invalid solution
Return the 3n+1 sequence for n
Math with Roman Numerals
Project Euler: Problem 7, Nth prime
Back to basics 1 - Saving
The Birthday Phenomenon
Restricted Addition v2
Restricted Addition v1
Test Driven Solution - Probability Problem 3
Restricted Subtraction v1
Test Driven Solution - Probability Problem 2
Find the treasures in MATLAB Central and discover how the community can help you!
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