\uc774\ud56d \uacc4\uc218(Binomial Coefficient)\ub294 \uc870\ud569\ub860\uc5d0\uc11c \ub450 \uac1c\uc758 \uc815\uc218 \uc5ec\uae30\uc11c \uc774\ud56d\uacc4\uc218\ub97c \uacc4\uc0b0\ud558\uae30 \uc704\ud574\uc11c\ub294 \uc6b0\uc120\uc801\uc73c\ub85c \ud329\ud1a0\ub9ac\uc5bc\uc744 \uad6c\ud574\uc8fc\uc5b4\uc57c \ud569\ub2c8\ub2e4. \ud329\ud1a0\ub9ac\uc5bc\uc744 \uc7ac\uadc0\uc801\uc73c\ub85c \uc815\uc758\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \uc608\ub97c \ub4e4\uc5b4, \uc774 \ubc94\uc704\ub97c \uc0ac\uc6a9\ud558\uc5ec \uc774\ud56d\uacc4\uc218\ub97c \uacc4\uc0b0\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \ud558\uc9c0\ub9cc \uc774 \ubc29\ubc95\uc758 \ub2e8\uc810\uc740 \ud070 \uc22b\uc790\uc5d0 \ub300\ud574 \uba54\ubaa8\ub9ac \ud55c\uacc4 \ubc0f \uc2e4\ud589 \uc2dc\uac04\uc5d0 \uc601\ud5a5\uc744 \uc904 \uc218 \uc788\ub2e4\ub294 \uac83\uc785\ub2c8\ub2e4.<\/p>\n \uc774\ud56d\uacc4\uc218\ub97c \ud6a8\uc728\uc801\uc73c\ub85c \uacc4\uc0b0\ud558\ub294 \ub610 \ub2e4\ub978 \ubc29\ubc95\uc740 \ubc18\ubcf5\ubb38\uc744 \uc0ac\uc6a9\ud558\ub294 \uac83\uc785\ub2c8\ub2e4. \ud329\ud1a0\ub9ac\uc5bc\uc744 \uc9c1\uc811 \uacc4\uc0b0\ud558\ub294 \ub300\uc2e0, \uc774\ud56d\uacc4\uc218\ub97c \uc9c1\uc811 \uacc4\uc0b0\ud558\ub294 \ubc29\ubc95\uc774 \uc788\uc2b5\ub2c8\ub2e4. \ub2e4\uc74c\uc758 \ubc18\ubcf5\ubb38\uc744 \uc774\uc6a9\ud558\uba74 \ub429\ub2c8\ub2e4:<\/p>\n \uc544\ub798\ub294 \uc804\uccb4 \ucf54\ub4dc\ub97c \ud1b5\ud569\ud55c \uc608\uc2dc\uc785\ub2c8\ub2e4:<\/p>\nn<\/code>\uacfc k<\/code>\ub97c \uc0ac\uc6a9\ud558\uc5ec, C(n, k)<\/code>\ub85c \ud45c\uae30\ud558\uba70, n<\/code>\uac1c\uc758 \uc694\uc18c \uc911\uc5d0\uc11c k<\/code>\uac1c\uc758 \uc694\uc18c\ub97c \uc120\ud0dd\ud558\ub294 \ubc29\ubc95\uc758 \uc218\ub97c \uc758\ubbf8\ud569\ub2c8\ub2e4. \uc774\ud56d \uacc4\uc218\ub294 \ub2e4\uc74c\uacfc \uac19\uc740 \uacf5\uc2dd\uc73c\ub85c \uacc4\uc0b0\ub429\ub2c8\ub2e4:<\/p>\nC(n, k) = n! \/ (k! * (n - k)!)<\/code><\/pre>\nn!<\/code> (n \ud329\ud1a0\ub9ac\uc5bc)\uc740 n<\/code>\ubd80\ud130 1<\/code>\uae4c\uc9c0\uc758 \ubaa8\ub4e0 \uc815\uc218\ub97c \uacf1\ud55c \uac83\uc785\ub2c8\ub2e4.<\/p>\n\uc608\uc81c \uc785\ub825 \ubc0f \ucd9c\ub825<\/h2>\n
\uc785\ub825<\/h3>\n
\n
n<\/code>\uacfc k<\/code> (0 <= k<\/code> <= n<\/code> <= 30)\uac00 \uc8fc\uc5b4\uc9d1\ub2c8\ub2e4.<\/li>\n<\/ul>\n\ucd9c\ub825<\/h3>\n
\n
C(n, k)<\/code>\uc758 \uac12\uc744 \ucd9c\ub825\ud569\ub2c8\ub2e4.<\/li>\n<\/ul>\n\ubb38\uc81c \ud480\uc774 \uacfc\uc815<\/h2>\n
1. \uc774\ub860\uc801 \ubc30\uacbd<\/h3>\n
n!<\/code>, k!<\/code>, \uadf8\ub9ac\uace0 (n-k)!<\/code>\ub97c \uad6c\ud574\uc57c \ud558\uace0, \uc774\ub97c \ud1b5\ud574 \uc774\ud56d\uacc4\uc218\ub97c \uacc4\uc0b0\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \uc774\ub860\uc801\uc73c\ub85c\ub294 \uc704\uc758 \uacf5\uc2dd\uc5d0 \ub530\ub77c \uacc4\uc0b0\uc774 \uac00\ub2a5\ud558\uc9c0\ub9cc, \uc790\ubc14\uc2a4\ud06c\ub9bd\ud2b8\ub97c \uc774\uc6a9\ud574 \ud6a8\uc728\uc801\uc73c\ub85c \uad6c\ud604\ud558\uae30 \uc704\ud574 \uc6b0\ub9ac\ub294 \uc7ac\uadc0 \ud568\uc218 \ubc0f \ubc18\ubcf5\ubb38 \ub450 \uac00\uc9c0 \ubc29\ubc95\uc744 \ud65c\uc6a9\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4.<\/p>\n2. \uc7ac\uadc0\uc801 \uc811\uadfc<\/h3>\n
n!<\/code>\uc740 \ub2e4\uc74c\uacfc \uac19\uc774 \uc815\uc758\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4:<\/p>\nfunction factorial(n) {\n if (n <= 1) return 1;\n return n * factorial(n - 1);\n }<\/code><\/pre>\n3. \ubc18\ubcf5\uc801 \uc811\uadfc<\/h3>\n
function binomialCoefficient(n, k) {\n if (k > n) return 0;\n if (k === 0 || k === n) return 1;\n k = Math.min(k, n - k); \/\/ k\ub294 n-k\ubcf4\ub2e4 \uc791\uac70\ub098 \uac19\uc544\uc57c \ud568\n let result = 1;\n\n for (let i = 0; i < k; i++) {\n result *= (n - i);\n result \/= (i + 1);\n }\n return result;\n }<\/code><\/pre>\n4. \uc804\uccb4 \ucf54\ub4dc<\/h2>\n
\n function factorial(n) {\n if (n <= 1) return 1;\n return n * factorial(n - 1);\n }\n\n function binomialCoefficient(n, k) {\n if (k > n) return 0;\n if (k === 0 || k === n) return 1;\n k = Math.min(k, n - k); \/\/ k\ub294 n-k\ubcf4\ub2e4 \uc791\uac70\ub098 \uac19\uc544\uc57c \ud568\n let result = 1;\n\n for (let i = 0; i < k; i++) {\n result *= (n - i);\n result \/= (i + 1);\n }\n return result;\n }\n\n \/\/ \uc608\uc2dc \uc0ac\uc6a9\n const n = 5;\n const k = 2;\n console.log(`C(${n}, ${k}) = ${binomialCoefficient(n, k)}`); \/\/ \ucd9c\ub825: C(5, 2) = 10\n <\/code><\/pre>\n5. \uc131\ub2a5 \ubd84\uc11d<\/h2>\n