Properties
Category
English
Similar Topics
Statistics
Comments
4
Participants
3
Subscribers
4
Votes
5
Views
2529
Share
Under Consideration
Hi!
It would be nice to have a fast factory command to compute all k-combinations of a set S with size n. The BinomialCoefficient[n, k] computes the number of such k-combinations but, indeed, I would like to list all of them. For instance,
CombinationList[{1, 2, 3, 4, 5}, 4] would return { {2, 3, 4, 5}, {1, 3, 4, 5}, {1, 2, 4, 5}, {1, 2, 3, 5}, {1, 2, 3, 4}}.
Thanks, Humberto.
- GeoGebra
- Help
- Partners
-
Contact us
- Feedback & Questions
- This email address is being protected from spambots. You need JavaScript enabled to view it.
- +43 677 6137 2693
© 2023 International GeoGebra Institute
hello
in the meantime this can help you. I hope
http://forum.geogebra.org/v...
saludos
Thanks, Mathmagic. I hope developers implement such commands soon. Using your algorithm, it is not possible to list combinations with n = 10 e p = 4 ...
Comments have been locked on this page!