GY-63_MS5611/libraries/statHelpers/investigation.md



As the formula for combinations is symmetrical one knows that:

- if it works for (N, 0..k) it will also work for (N, n-k..n)
- if it works for (N, 0..k) it will also work for (N-1, 0..k)
- (n, 0) = 1; (n, 1) = n; (n, 2) = n \* (n+1) / 2;  
- from the latter a rule of thumb states that nCr(n,k) < n^k

assume nCr(n,k) > MAXVAL && nCr(n,k-1) <= MAXVAL

k = 2log(MAXVAL) / 2log(n);
zoiets.
2021-01-29 2021-01-29 06:31:58 -05:00

			`As the formula for combinations is symmetrical one knows that:`

			`- if it works for (N, 0..k) it will also work for (N, n-k..n)`
			`- if it works for (N, 0..k) it will also work for (N-1, 0..k)`
0.1.4 statHelpers 2021-12-28 09:37:03 -05:00			`- (n, 0) = 1; (n, 1) = n; (n, 2) = n \* (n+1) / 2;`
2021-01-29 2021-01-29 06:31:58 -05:00			`- from the latter a rule of thumb states that nCr(n,k) < n^k`

			`assume nCr(n,k) > MAXVAL && nCr(n,k-1) <= MAXVAL`

			`k = 2log(MAXVAL) / 2log(n);`
			`zoiets.`