{"id":154,"date":"2020-07-02T02:56:48","date_gmt":"2020-07-02T02:56:48","guid":{"rendered":"\/?p=154"},"modified":"2020-07-02T02:59:26","modified_gmt":"2020-07-02T02:59:26","slug":"prime-number","status":"publish","type":"post","link":"http:\/\/suryaprakash.com.np\/?p=154","title":{"rendered":"Prime Number"},"content":{"rendered":"

\/\/To check whether the given number is prime or not<\/span>
\n#include<stdio.h><\/span>
\nvoid main()<\/span>
\n{<\/span>
\nint i, n;<\/span>
\nprintf(“enter the value of n\\t”);<\/span>
\nscanf(“%d”,&n);<\/span>
\nfor(i=2;i<=n;i++)<\/span>
\n{<\/span>
\nif(n%i==0)<\/span><\/p>\n

break;<\/span><\/p>\n

}<\/span>
\nif(i==n)<\/span>
\nprintf(“\\n%d is prime number”,n);<\/span>
\nelse<\/span>
\nprintf(“\\n%d is not prime”,n);<\/span>
\n}<\/span><\/p>\n

OUTPUT<\/strong><\/span><\/p>\n

\"\" \"\"<\/p>\n

Logic Description:<\/strong><\/span><\/p>\n

Since every number is divisible by 1.So i started to check the remainder value from 2. If the number is completely divisible by any number between 1 and and n except 1 and and n then the number is not prime else our count(i) will increase up-to n.When i and n are equal, the given number is never divided between 1 and the number because if the number is divided at once immediately our program break from the main logic and i and n never be equal. In this way prime and non-prime is checked.<\/p>\n

Prime Number Between Range(1-1000)<\/h1>\n

#include<stdio.h><\/span>
\nvoid main()<\/span>
\n{<\/span>
\nint i, j;<\/span>
\nfor(j=1;j<=1000;j++)<\/span><\/p>\n

{<\/span><\/p>\n

for(i=2;i<=j;i++)<\/span>
\n{<\/span>
\nif(j%i==0)<\/span><\/p>\n

break;<\/span><\/p>\n

}<\/span>
\nif(j==i)<\/span>
\nprintf(“\\t%d”,j);<\/span><\/p>\n

}<\/span>
\n}<\/span><\/p>\n

OUTPUT<\/strong><\/p>\n

\"\"<\/p>\n

Here the range is fixed from 1 -1000. We can change the range according to our requirement.The range can also be defined at run time by taking input from keyboard.<\/p>\n","protected":false},"excerpt":{"rendered":"

\/\/To check whether the given number is prime or not #include<stdio.h> void main() { int i, n; printf(“enter the value … <\/p>\n","protected":false},"author":1,"featured_media":157,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[7],"tags":[],"_links":{"self":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/154"}],"collection":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=154"}],"version-history":[{"count":3,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/154\/revisions"}],"predecessor-version":[{"id":161,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/154\/revisions\/161"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/media\/157"}],"wp:attachment":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=154"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=154"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}