Anonymous user
Talk:Combinations: Difference between revisions
m
Thanked Nigel Galloway for answering my question.
m (Thanked Nigel Galloway for answering my question.) |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 19:
With respect to you, Ivan Gavryushin (dcc0@).
== PARI/GP ==
The function definition is:<br />
c(n,k,r,d)
c = combinations<br />
n = number of objects<br />
k = sample size<br />
r = ?<br />
d = ?
What are r and d? [[User:Chuck Coker|Chuck Coker]] ([[User talk:Chuck Coker|talk]]) 02:00, 31 July 2019 (UTC)
:You may not be familiar with recursive patterns. The function c is recursive. d is a count of the current depth, r is sort of an accumulator keeping the permutation thus far. So when d=k the combination is complete and r is printed.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 11:16, 31 July 2019 (UTC)
:: Thanks for the info. [[User:Chuck Coker|Chuck Coker]] ([[User talk:Chuck Coker|talk]]) 12:30, 31 July 2019 (UTC)
| |||