{"id":27881,"date":"2024-10-27T15:20:09","date_gmt":"2024-10-27T15:20:09","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=27881"},"modified":"2024-11-26T07:14:10","modified_gmt":"2024-11-26T07:14:10","slug":"%ec%9e%90%eb%b0%94%ec%8a%a4%ed%81%ac%eb%a6%bd%ed%8a%b8-%ec%bd%94%eb%94%a9%ed%85%8c%ec%8a%a4%ed%8a%b8-%ea%b0%95%ec%a2%8c-%ec%8b%a0%ea%b8%b0%ed%95%9c-%ec%86%8c%ec%88%98-%ec%b0%be%ea%b8%b0","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/27881\/","title":{"rendered":"\uc790\ubc14\uc2a4\ud06c\ub9bd\ud2b8 \ucf54\ub529\ud14c\uc2a4\ud2b8 \uac15\uc88c, \uc2e0\uae30\ud55c \uc18c\uc218 \ucc3e\uae30"},"content":{"rendered":"

<\/p>\n

\ubb38\uc81c \uc124\uba85<\/h2>\n

\uc218\ud559\uc801\uc73c\ub85c \uc815\uc758\ub41c \uc18c\uc218(Prime Number)\ub294 1\uacfc \uc790\uae30 \uc790\uc2e0 \uc678\uc5d0 \ub2e4\ub978 \uc57d\uc218\ub97c \uac00\uc9c0\uc9c0 \uc54a\ub294 \uc790\uc5f0\uc218\uc785\ub2c8\ub2e4. \uc608\ub97c \ub4e4\uc5b4, 2, 3, 5, 7, 11, 13 \ub4f1\uc740 \uc18c\uc218\uc5d0 \ud574\ub2f9\ud569\ub2c8\ub2e4. \uc774\ubc88 \ubb38\uc81c\uc5d0\uc11c\ub294 \uc2e0\uae30\ud55c \uc18c\uc218<\/strong>\ub97c \ucc3e\uc544\uc57c \ud569\ub2c8\ub2e4. \uc2e0\uae30\ud55c \uc18c\uc218\ub780 \ud2b9\uc815 \uae30\uc900\uc5d0 \uc758\ud558\uc5ec \ud310\ubcc4\ub418\ub294 \uc18c\uc218\ub97c \uc758\ubbf8\ud569\ub2c8\ub2e4.<\/p>\n

\ubb38\uc81c \uc815\uc758<\/h3>\n

\uc8fc\uc5b4\uc9c4 \uc815\uc218 N<\/code>\uc5d0 \ub300\ud574, N<\/code>\ubcf4\ub2e4 \uc791\uc740 \ubaa8\ub4e0 \uc2e0\uae30\ud55c \uc18c\uc218\ub97c \ucc3e\uc544 \ubc30\uc5f4\ub85c \ubc18\ud658\ud558\uc138\uc694. \uc2e0\uae30\ud55c \uc18c\uc218\ub294 \ub2e4\uc74c\uc758 \uae30\uc900\uc744 \ub530\ub978\ub2e4\uace0 \uac00\uc815\ud569\ub2c8\ub2e4:<\/p>\n

    \n
  1. \uc2e0\uae30\ud55c \uc18c\uc218\ub294 2 \uc774\uc0c1\uc758 \uc790\uc5f0\uc218\uc5ec\uc57c \ud55c\ub2e4.<\/li>\n
  2. \uc18c\uc218\uc758 \uac01 \uc790\ub9bf\uc218\uc758 \ud569\uc774 10\uc744 \ucd08\uacfc\ud558\uba74 \uc2e0\uae30\ud55c \uc18c\uc218\uac00 \uc544\ub2c8\ub2e4.<\/li>\n
  3. \uac01 \uc790\ub9bf\uc218\ub294 \uc9dd\uc218\ubcf4\ub2e4 \ud640\uc218\uc758 \uc790\ub9bf\uc218\uac00 \ub354 \ub9ce\uc544\uc57c \ud55c\ub2e4.<\/li>\n
  4. \uac01 \uc790\ub9bf\uc218\ub294 \ubc18\ub4dc\uc2dc \uc815\uc218\uc5ec\uc57c \ud558\uba70, \uc74c\uc218\ub97c \ud3ec\ud568\ud574\uc120 \uc548 \ub41c\ub2e4.<\/li>\n<\/ol>\n

    \uc785\ub825 \ubc0f \ucd9c\ub825 \ud615\uc2dd<\/h3>\n

    \n\uc785\ub825:<\/strong> \uc591\uc758 \uc815\uc218 N<\/code> (2 \u2264 N<\/code> \u2264 10,000)
    \n\ucd9c\ub825:<\/strong> \uc815\uc218 \ubc30\uc5f4 (\uc2e0\uae30\ud55c \uc18c\uc218\ub4e4)\n <\/p>\n

    \ubb38\uc81c \ud480\uc774 \uacfc\uc815<\/h2>\n

    \ub2e8\uacc4 1: \uc18c\uc218 \ud310\ubcc4 \ud568\uc218 \uad6c\ud604<\/h3>\n

    \uc18c\uc218\ub97c \ud310\ubcc4\ud558\ub294 \ud568\uc218\ub97c \uad6c\ud604\ud569\ub2c8\ub2e4. \uc774 \ud568\uc218\ub294 \uc785\ub825\ub41c \uc22b\uc790\uac00 \uc18c\uc218\uc778\uc9c0 \uc5ec\ubd80\ub97c \ud655\uc778\ud574\uc57c \ud569\ub2c8\ub2e4. \uc774\ub54c \uc18c\uc218\uc758 \uc815\uc758\uc5d0 \ub530\ub77c 2\ubd80\ud130 \uc2dc\uc791\ud558\uc5ec \ud574\ub2f9 \uc22b\uc790\uc758 \uc81c\uacf1\uadfc\uae4c\uc9c0 \ub098\ub204\uc5b4 \ub5a8\uc5b4\uc9c0\ub294\uc9c0 \uac80\uc0ac\ud569\ub2c8\ub2e4.<\/p>\n

    function isPrime(num) {\n        if (num <= 1) return false;\n        if (num <= 3) return true;\n        if (num % 2 === 0 || num % 3 === 0) return false;\n\n        for (let i = 5; i * i <= num; i += 6) {\n            if (num % i === 0 || num % (i + 2) === 0) return false;\n        }\n        return true;\n    }<\/code><\/pre>\n
    \ub2e8\uacc4 2: \uc2e0\uae30\ud55c \uc18c\uc218 \ud310\ubcc4 \ud568\uc218 \uad6c\ud604<\/h3>\n
    \uc2e0\uae30\ud55c \uc18c\uc218\ub97c \ud310\ubcc4\ud558\ub294 \ud568\uc218\ub97c \uad6c\ud604\ud569\ub2c8\ub2e4. \uc774 \uae30\ub2a5\uc740 \uc8fc\uc5b4\uc9c4 \uc22b\uc790\uc758 \uc790\ub9bf\uc218\uc758 \ud569\uacfc \uc790\ub9bf\uc218\ub97c \uc138\ub294 \uae30\ub2a5\uc744 \ud3ec\ud568\ud574\uc57c \ud569\ub2c8\ub2e4.<\/p>\n
    function isCuriousPrime(num) {\n        if (!isPrime(num)) return false;\n\n        const digits = num.toString().split('').map(Number);\n        const sumOfDigits = digits.reduce((acc, digit) => acc + digit, 0);\n        const oddCount = digits.filter(digit => digit % 2 !== 0).length;\n        const evenCount = digits.filter(digit => digit % 2 === 0).length;\n\n        return sumOfDigits <= 10 && oddCount > evenCount;\n    }<\/code><\/pre>\n
    \ub2e8\uacc4 3: \uacb0\uacfc \uc0dd\uc131 \ud568\uc218 \uad6c\ud604<\/h3>\n
    \uc774\uc81c \uc785\ub825\ub41c N<\/code>\ubcf4\ub2e4 \uc791\uc740 \ubaa8\ub4e0 \uc2e0\uae30\ud55c \uc18c\uc218\ub97c \ucc3e\uae30 \uc704\ud55c \uba54\uc778 \ud568\uc218\uc778 findCuriousPrimes<\/code>\ub97c \uc0dd\uc131\ud569\ub2c8\ub2e4.<\/p>\n
    function findCuriousPrimes(N) {\n        const curiousPrimes = [];\n        for (let i = 2; i < N; i++) {\n            if (isCuriousPrime(i)) {\n                curiousPrimes.push(i);\n            }\n        }\n        return curiousPrimes;\n    }<\/code><\/pre>\n
    \ub2e8\uacc4 4: \uc804\uccb4 \ucf54\ub4dc \ubc0f \uc608\uc81c \uc2e4\ud589<\/h3>\n
    \uc704\uc5d0\uc11c \uc791\uc131\ud55c \ud568\uc218\ub4e4\uc744 \ud1b5\ud569\ud558\uc5ec \uc804\uccb4 \ucf54\ub4dc\ub97c \uc644\uc131\ud569\ub2c8\ub2e4. \uc544\ub798\ub294 \ucd5c\uc885\uc801\uc778 \ucf54\ub4dc \uc608\uc81c\uc785\ub2c8\ub2e4.<\/p>\n
    function isPrime(num) {\n        if (num <= 1) return false;\n        if (num <= 3) return true;\n        if (num % 2 === 0 || num % 3 === 0) return false;\n\n        for (let i = 5; i * i <= num; i += 6) {\n            if (num % i === 0 || num % (i + 2) === 0) return false;\n        }\n        return true;\n    }\n\n    function isCuriousPrime(num) {\n        if (!isPrime(num)) return false;\n\n        const digits = num.toString().split('').map(Number);\n        const sumOfDigits = digits.reduce((acc, digit) => acc + digit, 0);\n        const oddCount = digits.filter(digit => digit % 2 !== 0).length;\n        const evenCount = digits.filter(digit => digit % 2 === 0).length;\n\n        return sumOfDigits <= 10 && oddCount > evenCount;\n    }\n\n    function findCuriousPrimes(N) {\n        const curiousPrimes = [];\n        for (let i = 2; i < N; i++) {\n            if (isCuriousPrime(i)) {\n                curiousPrimes.push(i);\n            }\n        }\n        return curiousPrimes;\n    }\n\n    console.log(findCuriousPrimes(50));  \/\/ Example Output: [3, 5, 7, 11, 13, 17, 23, 29, 31, 37, 41, 43, 47]\n    <\/code><\/pre>\n
    \ucd5c\uc801\ud654 \ubc29\uc548<\/h2>\n
    \ud604\uc7ac \uad6c\ud604\ub41c \uc54c\uace0\ub9ac\uc998\uc740 N\uc5d0 \ube44\ub840\ud558\ub294 \uc2dc\uac04\ubcf5\uc7a1\ub3c4\ub97c \uac00\uc9c0\uba70, \uac1c\uc120 \uac00\ub2a5\uc131\uc774 \uc788\uc2b5\ub2c8\ub2e4. \uc18c\uc218\ub97c \uba3c\uc800 \ubbf8\ub9ac \uacc4\uc0b0\ud558\uc5ec \ubc30\uc5f4\uc5d0 \uc800\uc7a5\ud574\ub193\uace0, \uc774 \ubc30\uc5f4\uc744 \uc774\uc6a9\ud574 \uc2e0\uae30\ud55c \uc18c\uc218\ub97c \ucc3e\ub294 \ubc29\uc2dd\uc73c\ub85c \ucd5c\uc801\ud654 \ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4.<\/p>\n
    \uacb0\ub860<\/h2>\n
    \uc774 \uae00\uc5d0\uc11c\ub294 \uc790\ubc14\uc2a4\ud06c\ub9bd\ud2b8\ub85c \uc2e0\uae30\ud55c \uc18c\uc218\ub97c \ucc3e\ub294 \ubc29\ubc95\uc744 \ub2e4\ub8e8\uc5c8\uc2b5\ub2c8\ub2e4. \uc54c\uace0\ub9ac\uc998\uc744 \ub2e8\uacc4\ubcc4\ub85c \ub098\ub204\uc5b4 \uc124\uba85\ud558\uc600\uc73c\uba70, \ucd5c\uc885\uc801\uc778 \ucf54\ub4dc\ub3c4 \ud3ec\ud568\ud558\uc600\uc2b5\ub2c8\ub2e4. \uc774 \ubb38\uc81c\ub97c \ud480\uc5b4\ubcf4\uba74\uc11c \uc790\ubc14\uc2a4\ud06c\ub9bd\ud2b8\uc758 \uc870\uac74\ubb38, \ubc18\ubcf5\ubb38 \ubc0f \ubc30\uc5f4 \uc870\uc791\uc5d0 \ub300\ud55c \uc774\ud574\ub97c \uae4a\uc774 \uc788\uac8c \ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4.<\/p>\n
    \ucc38\uace0 \uc790\ub8cc \ubc0f Links<\/h2>\n