15:24 Dec 27, 2020 |
Spanish to English translations [PRO] Science - Mathematics & Statistics / combinatrics, probability | |||||||
---|---|---|---|---|---|---|---|
|
| ||||||
| Selected response from: matt robinson Spain Local time: 10:26 | ||||||
Grading comment
|
Summary of answers provided | ||||
---|---|---|---|---|
4 +3 | ... at a time |
| ||
4 | choose [ p] |
| ||
3 | taken from 'p' ... on 'p' |
|
Discussion entries: 8 | |
---|---|
choose [ p] Explanation: Your original 'chooses ***p**'. Other examples choose k or n (just an optional name for a variable): 'Choose k': "Variations are arrangements of selections of objects, where the order of the selected objects matters. To count k-element variations of n objects, we first need to ***choose a k-element*** combination and then a permutation of the selected objects". https://webpages.uncc.edu/ghetyei/courses/old/S19.3166/pcv.p... 'Choose n': "Each such choice is called a variation with repetition of m elements ***choose n***. " http://www.mathspadilla.com/macsII/Unit8-Combinatorics/varia... HTH :-) -------------------------------------------------- Note added at 58 mins (2020-12-27 16:22:09 GMT) -------------------------------------------------- from a set of 'm' elements (in your original) you *choose* (select / extract) sub-sets of size 'p' (obviously, p has to be less than m) :-) |
| |
Login to enter a peer comment (or grade) |
... at a time Explanation: I believe they mean "taken p at a time" (for example, 3 at a time), where p is less than or equal to m. If you look at the solution to sample question 1 in the link, you have an example. https://stattrek.com/online-calculator/combinations-permutations.aspx |
| |
Grading comment
| ||