tag:blogger.com,1999:blog-4263711503992532713.post8086032349829788620..comments2024-02-12T02:16:08.092-08:00Comments on C PROGRAMS BLOG: C program to print Prime Numbers Between 1 and nSameer Shaikhttp://www.blogger.com/profile/10335374006374027873noreply@blogger.comBlogger21125tag:blogger.com,1999:blog-4263711503992532713.post-39292831951143730862018-09-18T04:50:54.861-07:002018-09-18T04:50:54.861-07:00It is nice article to improve knowledge.thank you ...It is nice article to improve knowledge.thank you for sharing article.<br />web programming tutorial<br /><a href="https://www.welookups.com" rel="nofollow">welookups</a><br />sumanhttps://www.blogger.com/profile/02683678626796708367noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-26088292637756140282017-11-14T07:58:28.249-08:002017-11-14T07:58:28.249-08:00What is a prime number? This definition explains w...What is a prime number? This definition explains what a prime number is and lists examples. See also different types of primes and links to information about <a href="http://nuclearstrategy.co.uk/prime-number-distribution-series" rel="nofollow">prime number</a> distribution .Anonymoushttps://www.blogger.com/profile/07009007828060154633noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-5649881400082089402017-07-13T06:27:24.263-07:002017-07-13T06:27:24.263-07:00Prime Number Distribution Series (PNDS), developed...<a href="http://nuclearstrategy.co.uk/prime-number-distribution-series" rel="nofollow">Prime Number Distribution Series</a> (PNDS), developed by the NSI team of mathematicians2 which computes the exact count of primes numbers.Anonymoushttps://www.blogger.com/profile/07009007828060154633noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-48125032357809584402017-03-15T20:47:54.675-07:002017-03-15T20:47:54.675-07:00Prime Number Program in C
#include
#include
voi...<a href="http://www.sitesbay.com/cpp-program/cpp-prime-number-program" rel="nofollow">Prime Number Program in C</a><br /><br />#include <br />#include <br />void main()<br />{<br />int num,res=0;<br />clrscr();<br />printf("\nENTER A NUMBER: ");<br />scanf("%d",&num);<br />res=prime(num);<br />if(res==0)<br />printf("\n%d is a prime number",num);<br />else<br />printf("\n%d is not a prime number",num);<br />getch();<br />}<br />int prime(int n)<br />{<br />int i;<br />for(i=2;i<=n/2;i++)<br />{<br />if(n%i!=0)<br />continue;<br />else<br />return 1;<br />}<br />return 0;<br />}<br />hitesh kumarhttps://www.blogger.com/profile/11487666627157593145noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-11108836821539895042017-01-16T01:41:59.743-08:002017-01-16T01:41:59.743-08:00i did not get you, can u plz explain clearly ?i did not get you, can u plz explain clearly ?Sameer Shaikhttps://www.blogger.com/profile/10335374006374027873noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-72533488935797179232017-01-10T06:38:25.797-08:002017-01-10T06:38:25.797-08:00my program exits time limit...
what I do...my program exits time limit...<br />what I do...Anonymoushttps://www.blogger.com/profile/11008004564158124256noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-18144359767028637632017-01-10T06:36:07.761-08:002017-01-10T06:36:07.761-08:00my program exits time limit...
what I do...my program exits time limit...<br />what I do...Anonymoushttps://www.blogger.com/profile/11008004564158124256noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-88951765906287885472016-07-02T05:31:50.762-07:002016-07-02T05:31:50.762-07:00A much faster algorithm would be to Check for only...A much faster algorithm would be to Check for only those numbers whose remainder is 1 or 5 when divided by 6 , but this algorithm excludes 2 and 3. So those could be taken care ofAnonymoushttps://www.blogger.com/profile/09948472920179058748noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-3804757054064124252016-07-02T05:21:26.921-07:002016-07-02T05:21:26.921-07:00A much faster algorithm would be to Check for only...A much faster algorithm would be to Check for only those numbers whose remainder is 1 or 5 when divided by 6 , but this algorithm excludes 2 and 3. So those could be taken care ofAnonymoushttps://www.blogger.com/profile/09948472920179058748noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-70068825243637610092016-07-02T05:20:48.830-07:002016-07-02T05:20:48.830-07:00A much faster algorithm would be to Check for only...A much faster algorithm would be to Check for only those numbers whose remainder is 1 or 5 when divided by 6 , but this algorithm excludes 2 and 3. So those could be taken care ofAnonymoushttps://www.blogger.com/profile/09948472920179058748noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-80239921198925769552016-01-21T03:17:41.714-08:002016-01-21T03:17:41.714-08:00This point has dependably been one of my most love...This point has dependably been one of my most loved subjects to peruse about. I have observed your post to be exceptionally energizing and brimming with great data. I will check your different articles in the blink of an eye.. <a href="http://www.buzzapplications.com" rel="nofollow"> Buzz Applications </a>Anonymoushttps://www.blogger.com/profile/01627625345052932759noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-22076738350640042272016-01-19T04:10:18.941-08:002016-01-19T04:10:18.941-08:00Prime number program in C
Helpful program, keep s...<a href="http://www.tutorial4us.com/program/c-program-prime-number" rel="nofollow">Prime number program in C</a><br /><br />Helpful program, keep sharinghitesh kumarhttps://www.blogger.com/profile/00432375972592445320noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-54936506872462869432015-11-29T14:03:22.363-08:002015-11-29T14:03:22.363-08:00cool man ;)cool man ;)Anonymoushttps://www.blogger.com/profile/00148557991012172077noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-46790702738235391412015-10-30T11:36:19.020-07:002015-10-30T11:36:19.020-07:00print this
23 21 24 19 26 15 28 11 30 7 36print this<br />23 21 24 19 26 15 28 11 30 7 36Anonymoushttps://www.blogger.com/profile/13233373836343413777noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-16635759055611610662015-08-26T13:08:59.091-07:002015-08-26T13:08:59.091-07:00this is a PYTHON program to calculate the prime fa...this is a PYTHON program to calculate the prime factors of a number: ( quite fast and self made :p)<br /><br /><br />number=int(input('enter the number to be factorized'));<br />print ('the entered number was %d'%number);<br />divisor=2;<br />import math<br />sr=math.sqrt(number);<br />i=0;<br />factors=dict({});<br />while number%2==0:<br /> nwnumber=number/divisor;<br /> factors[i]=divisor;<br /> number=nwnumber;<br /> <br /> i=i+1;<br /> if number==0:<br /> break;<br /><br />divisor=3;<br />nwnumber=number;<br /><br />while number!=1:<br /> <br /><br /> if nwnumber%divisor==0 :<br /> factors[i]=divisor;<br /> nwnumber=nwnumber/divisor;<br /> i=i+1<br /> continue;<br /> elif nwnumber==1:<br /> break; <br /><br /> elif math.sqrt(nwnumber)>divisor: <br /> divisor=divisor+2 <br /> i=i+1<br /> else:<br /> i=i+1;<br /> factors[i]=nwnumber;<br /> break;<br /> <br />print ('the prime factors of the entered number are :');<br />print dict.values(factors)<br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /><br />Anonymoushttps://www.blogger.com/profile/17294733019819859708noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-50396872761743069282015-08-26T12:44:19.796-07:002015-08-26T12:44:19.796-07:00so slow algo yet :(
so slow algo yet :(<br />Anonymoushttps://www.blogger.com/profile/17294733019819859708noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-9675591073459383492015-07-22T22:33:21.035-07:002015-07-22T22:33:21.035-07:00what a lovely programme
thanks a lot
what a lovely programme<br />thanks a lot<br />Anonymoushttps://www.blogger.com/profile/11824325752301412388noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-77875410841809485252015-03-27T01:46:40.955-07:002015-03-27T01:46:40.955-07:00Easiest Program To How To Find Whether Given Numbe...<a href="http://freshersjunction.blogspot.in/2015/03/write-program-to-how-to-find-whether.html" rel="nofollow">Easiest Program To How To Find Whether Given Number Is Prime Number Or Not</a> Anonymoushttps://www.blogger.com/profile/05582784823776285484noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-78010637664876876592015-03-26T06:34:02.717-07:002015-03-26T06:34:02.717-07:00Excellent explanation by admin
Print Prime number...Excellent explanation by admin<br /><br /><a href="http://freshersjunction.blogspot.in/2015/02/prime-numbers-program-in-c-in-easiest.html" rel="nofollow">Print Prime numbers from 1 to n</a> Anonymoushttps://www.blogger.com/profile/05582784823776285484noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-43840282797128644062014-04-26T06:31:09.753-07:002014-04-26T06:31:09.753-07:00thanks for help.thanks for help.Anonymoushttps://www.blogger.com/profile/10716985243015884790noreply@blogger.comtag:blogger.com,1999:blog-4263711503992532713.post-50810967344023912662013-07-24T18:16:49.872-07:002013-07-24T18:16:49.872-07:00Best way to find prime numbers in C | Sieve Of Era...<a href="http://msumca2012.blogspot.com/2013/07/best-way-to-find-prime-numbers-in-c.html" rel="nofollow"><br />Best way to find prime numbers in C | Sieve Of Erasthothanese method to generate prime numbers |<br /></a>Anonymousnoreply@blogger.com