Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

rename statics/euler and sync b93 code with main repo

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 17:38:54 +01:00
parent 0efeb3afeb
commit 69e3f51730
409 changed files with 745 additions and 509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
www/statics/euler/Euler_Problem-053_description.md Normal file
View File

@@ -0,0 +1,11 @@
There are exactly ten ways of selecting three from five, `12345`:
> 123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
In combinatorics, we use the notation, `C(5,3) = 10`.
In general, `C(n,r) = n! / (r!(n?r)!)` ,where `r <= n, n! = n * (n?1) * ... * 3 * 2 * 1`, and `0! = 1`.
It is not until `n = 23`, that a value exceeds one-million: `C(23,10) = 1144066`.
How many, not necessarily distinct, values of `C(n,r)`, for `1 <= n <= 100`, are greater than one-million?