{"id":4133,"date":"2021-09-09T23:00:00","date_gmt":"2021-09-09T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=4133"},"modified":"2021-11-23T19:45:30","modified_gmt":"2021-11-23T14:15:30","slug":"c-program-to-check-whether-a-number-is-prime-or-not","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/c-program-to-check-whether-a-number-is-prime-or-not\/","title":{"rendered":"C Program To Check Whether a Number is Prime or Not"},"content":{"rendered":"\n<p>In this post, we will learn <strong>how to check whether<\/strong> <strong>a number is prime or not using C<\/strong> Programming language.<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/09\/c-program-to-check-prime-number-codingbroz.png\" alt=\"C Program To Check Whether a Number is Prime or Not\" class=\"wp-image-4135\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/09\/c-program-to-check-prime-number-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/09\/c-program-to-check-prime-number-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\n\n\n\n<p>A number is called a <strong>Prime number<\/strong>, if it is divisible only by itself and one. This means a Prime number has only two factors &#8211; 1 and the number itself. For example: 2, 3, 5, 7, 11, . . . etc.<\/p>\n\n\n\n<p>A number is called a Composite Number, if it has more than two factors. For example: 4, 15, 26, 98, . . . etc.<\/p>\n\n\n\n<p><strong>Note:<\/strong> 1 is neither a prime number nor composite number.<\/p>\n\n\n\n<p>So, without further ado, let\u2019s begin the tutorial.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662b397a07987\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662b397a07987\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/c-program-to-check-whether-a-number-is-prime-or-not\/#C_Program_To_Check_Whether_a_Number_is_Prime_or_Not\" title=\"C Program To Check Whether a Number is Prime or Not\">C Program To Check Whether a Number is Prime or Not<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/c-program-to-check-whether-a-number-is-prime-or-not\/#How_Does_This_Program_Work\" title=\"How Does This Program Work ?\">How Does This Program Work ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/c-program-to-check-whether-a-number-is-prime-or-not\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C_Program_To_Check_Whether_a_Number_is_Prime_or_Not\"><\/span><strong>C Program To Check Whether a Number is Prime or Not<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C Program To Check Whether a Number is Prime or Not\n#include &lt;stdio.h>\nint main(){\n    int num, i, c = 0;\n    \n    \/\/ Asking for Input\n    printf(\"Enter an Number: \");\n    scanf(\"%d\", &amp;num);\n    \n    \/\/ logic\n    for (i = 1; i &lt;= num; i++){\n        if (num % i == 0){\n            c++;\n        }\n    }\n    if (c == 2){\n        printf(\"%d is a Prime Number.\", num);\n    }\n    else {\n        printf(\"%d is not a Prime Number.\", num);\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter an Number: 7\r\n7 is a Prime Number.\r<\/code><\/pre>\n\n\n\n<p><strong>Output 2<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter an Number: 57\r\n57 is not a Prime Number.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"How_Does_This_Program_Work\"><\/span><strong>How Does This Program Work ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code><strong>    int num, i, c = 0;<\/strong>\r<\/code><\/pre>\n\n\n\n<p>In this program, we have declared three int data type variables named as <strong>num<\/strong>, <strong>i<\/strong> and <strong>c<\/strong>. Variable <strong>c<\/strong> is assigned a value of <strong>0<\/strong>.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><strong>    \/\/ Asking for Input\r\n    printf(\"Enter an Number: \");\r\n    scanf(\"%d\", &amp;num);<\/strong>\r<\/code><\/pre>\n\n\n\n<p>Then, the user is asked to enter a number which he\/she wants to check. This number will get stored in the <strong>num<\/strong> named variable.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code> <strong>   \/\/ logic\r\n    for (i = 1; i &lt;= num; i++){\r\n        if (num % i == 0){\r\n            c++;\r\n        }\r\n    }<\/strong>\r<\/code><\/pre>\n\n\n\n<p>Now, this program checks for the number of integers, <strong>num<\/strong> is completely divisible with. And the value of the number of factors is stored in the <strong>c<\/strong> named variable.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>   <strong> if (c == 2){\r\n        printf(\"%d is a Prime Number.\", num);\r\n    }\r\n    else {\r\n        printf(\"%d is not a Prime Number.\", num);\r\n    }<\/strong>\r<\/code><\/pre>\n\n\n\n<p>If the <strong>num<\/strong> contains exactly <strong>2<\/strong> factors, then the given number is a <strong>Prime number<\/strong> otherwise it\u2019s not a <strong>Prime number<\/strong>.<\/p>\n\n\n\n<p>Some of the used terms are as follow:<\/p>\n\n\n\n<p><strong>#include &lt;stdio.h&gt;<\/strong> &#8211; In the first line we have used #include, it is a preprocessor command that tells the compiler to include the contents of the stdio.h(standard input and output) file in the program.&nbsp;<\/p>\n\n\n\n<p>The <strong>stdio.h <\/strong>is a file which contains input and output functions like<strong> scanf()<\/strong> and<strong> printf()<\/strong> to take input and display output respectively.&nbsp;<\/p>\n\n\n\n<p><strong>Int main()<\/strong> &#8211; Here main() is the function name and int is the return type of this function. The Execution of any Programming written in C language begins with main() function.&nbsp;<\/p>\n\n\n\n<p><strong>scanf()<\/strong> &#8211; scanf() function is used to take input from the user.&nbsp;&nbsp;<\/p>\n\n\n\n<p><strong>printf()<\/strong> &#8211; printf() function is used to display and print the string under the quotation to the screen.&nbsp;&nbsp;<\/p>\n\n\n\n<p><strong>for loop <\/strong>&#8211; A loop is used for initializing a block of statements repeatedly until a given condition returns false.<\/p>\n\n\n\n<p><strong>If. . . else <\/strong>&#8211; An if statement can be followed by an optional else statement, which executes when the Boolean expression is false. If Statement executes when the Boolean expression is True.&nbsp;<\/p>\n\n\n\n<p><strong>% <\/strong>&#8211; It is known as Modulus Operator and provides remainder after division.<\/p>\n\n\n\n<p><strong>\/\/ <\/strong>&#8211; Used for Commenting in C.\u00a0<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>I hope after going through this post, you understand how to check whether a number is prime or not using C Programming language.<\/p>\n\n\n\n<p>If you have any doubt regarding the topic, feel free to contact us in the comment section. We will be delighted to help you.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will learn how to check whether a number is prime or not using C Programming language.<\/p>\n","protected":false},"author":2,"featured_media":4135,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[167,294],"tags":[222,286,285,206],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/09\/c-program-to-check-prime-number-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4133"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=4133"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4133\/revisions"}],"predecessor-version":[{"id":4136,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4133\/revisions\/4136"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/4135"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=4133"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=4133"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=4133"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}