{"id":34490,"date":"2024-11-01T09:28:34","date_gmt":"2024-11-01T09:28:34","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=34490"},"modified":"2024-11-01T11:41:03","modified_gmt":"2024-11-01T11:41:03","slug":"javascript-coding-test-course-euler-pi","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/34490\/","title":{"rendered":"JavaScript Coding Test Course, Euler Pi"},"content":{"rendered":"<p><body><\/p>\n<h2>Problem Description<\/h2>\n<p>\n        Euler&#8217;s totient function, or \u03c6(n), is a function that returns the number of integers between 1 and n that are coprime to n. For example, \u03c6(9) = 6 because 1, 2, 4, 5, 7, and 8 are coprime to 9.\n    <\/p>\n<p>\n        The task of this problem is to write a function, <strong>calculateTotient<\/strong>, that calculates \u03c6(N) for a given integer N. This function should correctly output the value of \u03c6(n) when n is greater than or equal to 1 and less than or equal to 10^6.\n    <\/p>\n<h2>Approach to the Problem<\/h2>\n<p>\n        There are several ways to calculate the Euler&#8217;s totient, but one of the most efficient methods is to use the prime factorization of n. The Euler&#8217;s totient function can be defined as follows:\n    <\/p>\n<ul>\n<li>\u03c6(p^k) = p^k &#8211; p^(k-1) (where p is a prime number and k is a natural number)<\/li>\n<li>\u03c6(n) = n \u00d7 (1 &#8211; 1\/p1) \u00d7 (1 &#8211; 1\/p2) \u00d7 &#8230; \u00d7 (1 &#8211; 1\/pk) (where p1, p2, &#8230;, pk are the prime factors of n)<\/li>\n<\/ul>\n<h2>Algorithm Steps<\/h2>\n<ol>\n<li>Get the input value N.<\/li>\n<li>Find the prime factors of N.<\/li>\n<li>Apply the \u03c6(n) formula for each prime factor and calculate the result.<\/li>\n<li>Return the result.<\/li>\n<\/ol>\n<h2>Code Implementation<\/h2>\n<p>\n        Below is the implementation of the <strong>calculateTotient<\/strong> function written in JavaScript. This function returns the Euler&#8217;s totient value for the given input n.\n    <\/p>\n<pre>\n        <code>\nfunction gcd(a, b) {\n    return b === 0 ? a : gcd(b, a % b);\n}\n\nfunction calculateTotient(n) {\n    let result = n; \/\/ Initial value is n\n    for (let p = 2; p * p <= n; p++) {\n        if (n % p === 0) { \/\/ If p is a prime factor of n\n            while (n % p === 0) {\n                n \/= p;\n            }\n            result *= (p - 1);\n            result \/= p; \/\/ Apply the Euler's totient formula\n        }\n    }\n    if (n > 1) { \/\/ If n is prime\n        result *= (n - 1);\n        result \/= n;\n    }\n    return result;\n}\n\nconsole.log(calculateTotient(9)); \/\/ Output: 6\n<\/code>\n        <\/pre>\n<h2>Code Explanation<\/h2>\n<p>\n        &#8211; The <strong>gcd<\/strong> function calculates the greatest common divisor of two numbers. This function is a basic algorithm used for prime factorization.\n    <\/p>\n<p>\n        &#8211; In the <strong>calculateTotient<\/strong> function, the variable <strong>result<\/strong> is initialized to n to account for changes related to the prime factors later.\n    <\/p>\n<p>\n        &#8211; Using a for loop, all numbers p from 2 to the square root of n are checked, recognizing p as a prime factor if n is a multiple of p.\n    <\/p>\n<p>\n        &#8211; Finally, additional operations are performed when n is greater than 1, specifically if n is prime, to obtain the result.\n    <\/p>\n<h2>Conclusion<\/h2>\n<p>\n        In this tutorial, we learned how to calculate the Euler&#8217;s totient function. I hope you gained an understanding of the importance of using mathematical concepts like prime factorization to solve algorithmic problems. Use topics like this to prepare for JavaScript coding tests.\n    <\/p>\n<h2>Additional Learning Resources<\/h2>\n<p>\n        &#8211; <a href=\"https:\/\/en.wikipedia.org\/wiki\/Euler%27s_totient_function\">Euler&#8217;s Totient Function<\/a><br \/>\n        &#8211; <a href=\"https:\/\/www.geeksforgeeks.org\/eulers-totient-function-phi-n\/\">Explanation of Euler&#8217;s Totient Function on GeeksforGeeks<\/a>\n<\/p>\n<p><\/body><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Problem Description Euler&#8217;s totient function, or \u03c6(n), is a function that returns the number of integers between 1 and n that are coprime to n. For example, \u03c6(9) = 6 because 1, 2, 4, 5, 7, and 8 are coprime to 9. The task of this problem is to write a function, calculateTotient, that calculates &hellip; <a href=\"https:\/\/atmokpo.com\/w\/34490\/\" class=\"more-link\">\ub354 \ubcf4\uae30<span class=\"screen-reader-text\"> &#8220;JavaScript Coding Test Course, Euler Pi&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[141],"tags":[],"class_list":["post-34490","post","type-post","status-publish","format-standard","hentry","category-javascript-coding-test"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/atmokpo.com\/w\/34490\/\" \/>\n<meta property=\"og:locale\" content=\"ko_KR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"Problem Description Euler&#8217;s totient function, or \u03c6(n), is a function that returns the number of integers between 1 and n that are coprime to n. For example, \u03c6(9) = 6 because 1, 2, 4, 5, 7, and 8 are coprime to 9. The task of this problem is to write a function, calculateTotient, that calculates &hellip; \ub354 \ubcf4\uae30 &quot;JavaScript Coding Test Course, Euler Pi&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/34490\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:28:34+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T11:41:03+00:00\" \/>\n<meta name=\"author\" content=\"root\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:site\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:label1\" content=\"\uae00\uc4f4\uc774\" \/>\n\t<meta name=\"twitter:data1\" content=\"root\" \/>\n\t<meta name=\"twitter:label2\" content=\"\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04\" \/>\n\t<meta name=\"twitter:data2\" content=\"1\ubd84\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"JavaScript Coding Test Course, Euler Pi\",\"datePublished\":\"2024-11-01T09:28:34+00:00\",\"dateModified\":\"2024-11-01T11:41:03+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/\"},\"wordCount\":367,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"Javascript Coding Test\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/\",\"url\":\"https:\/\/atmokpo.com\/w\/34490\/\",\"name\":\"JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:28:34+00:00\",\"dateModified\":\"2024-11-01T11:41:03+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/34490\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/34490\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"JavaScript Coding Test Course, Euler Pi\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/atmokpo.com\/w\/#website\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/atmokpo.com\/w\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"ko-KR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"contentUrl\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"width\":400,\"height\":400,\"caption\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\"},\"image\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/x.com\/bebubo4\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\",\"name\":\"root\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"caption\":\"root\"},\"sameAs\":[\"http:\/\/atmokpo.com\/w\"],\"url\":\"https:\/\/atmokpo.com\/w\/author\/root\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/atmokpo.com\/w\/34490\/","og_locale":"ko_KR","og_type":"article","og_title":"JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"Problem Description Euler&#8217;s totient function, or \u03c6(n), is a function that returns the number of integers between 1 and n that are coprime to n. For example, \u03c6(9) = 6 because 1, 2, 4, 5, 7, and 8 are coprime to 9. The task of this problem is to write a function, calculateTotient, that calculates &hellip; \ub354 \ubcf4\uae30 \"JavaScript Coding Test Course, Euler Pi\"","og_url":"https:\/\/atmokpo.com\/w\/34490\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:28:34+00:00","article_modified_time":"2024-11-01T11:41:03+00:00","author":"root","twitter_card":"summary_large_image","twitter_creator":"@bebubo4","twitter_site":"@bebubo4","twitter_misc":{"\uae00\uc4f4\uc774":"root","\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04":"1\ubd84"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/atmokpo.com\/w\/34490\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/34490\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"JavaScript Coding Test Course, Euler Pi","datePublished":"2024-11-01T09:28:34+00:00","dateModified":"2024-11-01T11:41:03+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/34490\/"},"wordCount":367,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["Javascript Coding Test"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/34490\/","url":"https:\/\/atmokpo.com\/w\/34490\/","name":"JavaScript Coding Test Course, Euler Pi - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:28:34+00:00","dateModified":"2024-11-01T11:41:03+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/34490\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/34490\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/34490\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"JavaScript Coding Test Course, Euler Pi"}]},{"@type":"WebSite","@id":"https:\/\/atmokpo.com\/w\/#website","url":"https:\/\/atmokpo.com\/w\/","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","description":"","publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/atmokpo.com\/w\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"ko-KR"},{"@type":"Organization","@id":"https:\/\/atmokpo.com\/w\/#organization","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","url":"https:\/\/atmokpo.com\/w\/","logo":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/","url":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","contentUrl":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","width":400,"height":400,"caption":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8"},"image":{"@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/x.com\/bebubo4"]},{"@type":"Person","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7","name":"root","image":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","caption":"root"},"sameAs":["http:\/\/atmokpo.com\/w"],"url":"https:\/\/atmokpo.com\/w\/author\/root\/"}]}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34490","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/comments?post=34490"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34490\/revisions"}],"predecessor-version":[{"id":34491,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34490\/revisions\/34491"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=34490"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=34490"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=34490"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}