如何快速求出100000以内的所有组合数？
C_m^n n \ge 2 这样的整数称之为组合数，如果n可以等于1的话，那么这个问题就没什么求的价值了 如何快速求出100000以内的所有这样的整数呢？ 不就是一些简单的不等式吗?$C_n^k<10^5$,其中对k=2,3,...等求解 1# mathematica
2<=n<=m-2应该是这个条件 6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91, 105, \
120, 126, 136, 153, 165, 171, 190, 210, 220, 231, 252, 253, 276, 286, \
300, 325, 330, 351, 364, 378, 406, 435, 455, 462, 465, 495, 496, 528, \
560, 561, 595, 630, 666, 680, 703, 715, 741, 780, 792, 816, 820, 861, \
903, 924, 946, 969, 990, 1001, 1035, 1081, 1128, 1140, 1176, 1225, \
1275, 1287, 1326, 1330, 1365, 1378, 1431, 1485, 1540, 1596, 1653, \
1711, 1716, 1770, 1771, 1820, 1830, 1891, 1953, 2002, 2016, 2024, \
2080, 2145, 2211, 2278, 2300, 2346, 2380, 2415, 2485, 2556, 2600, \
2628, 2701, 2775, 2850, 2925, 2926, 3003, 3060, 3081, 3160, 3240, \
3276, 3321, 3403, 3432, 3486, 3570, 3654, 3655, 3741, 3828, 3876, \
3916, 4005, 4060, 4095, 4186, 4278, 4368, 4371, 4465, 4495, 4560, \
4656, 4753, 4845, 4851, 4950, 4960, 5005, 5456, 5984, 5985, 6188, \
6435, 6545, 7140, 7315, 7770, 8008, 8436, 8568, 8855, 9139, 9880, \
10626, 10660, 11440, 11480, 11628, 12341, 12376, 12650, 12870, 13244, \
14190, 14950, 15180, 15504, 16215, 17296, 17550, 18424, 18564, 19448, \
19600, 20349, 20475, 20825, 22100, 23426, 23751, 24310, 24804, 26235, \
26334, 27132, 27405, 27720, 29260, 30856, 31465, 31824, 32509, 33649, \
34220, 35960, 35990, 37820, 38760, 39711, 40920, 41664, 42504, 43680, \
43758, 45760, 46376, 47905, 48620, 50116, 50388, 52360, 52394, 53130, \
54264, 54740, 57155, 58905, 59640, 62196, 64824, 65780, 66045, 67525, \
70300, 73150, 73815, 74613, 75582, 76076, 77520, 79079, 80730, 82160, \
82251, 85320, 88560, 91390, 91881, 92378, 95284, 98280, 98770
页:
[1]