{"id":16041,"date":"2014-11-07T14:39:59","date_gmt":"2014-11-07T14:39:59","guid":{"rendered":"http:\/\/www.beautifulwork.org\/?p=16041"},"modified":"2014-11-07T14:39:59","modified_gmt":"2014-11-07T14:39:59","slug":"how-to-write-a-program-to-find-10001st-prime-number","status":"publish","type":"post","link":"https:\/\/www.trueangle.org\/index.php\/2014\/11\/07\/how-to-write-a-program-to-find-10001st-prime-number\/","title":{"rendered":"A program to find 10001st prime number ?"},"content":{"rendered":"

ABOUT PRIME NUMBER<\/u><\/p>\n

\nA prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 \u00d7 5 or 5 \u00d7 1, involve 5 itself. However, 6 is composite because it is the product of two numbers (2 \u00d7 3) that are both smaller than 6. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.\n<\/pre>\n
TYPICAL SOURCE CODE RELATED<\/u>
\n[c]
\n\/*
\nThis code is worked on from http:\/\/notmyfaultsblog.blogspot.in\/2010\/06\/project-euler-problem-7-in-c.html
\nModified a little for standards by Jeffrin Jose T ahiliation@yahoo.co.in<\/p>\n
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
\nWhat is the 10 001st prime number?<\/p>\n
*\/<\/p>\n
#include <stdio.h>
\n#include <math.h><\/p>\n
int isPrime(int test)
\n{
\nint i;
\nint calculateTo = (int) sqrt(test);<\/p>\n
for(i = 3; i<=calculateTo; i+=2)
\n{
\nif(test%i==0)
\nreturn 0;
\n}<\/p>\n
return 1;
\n}<\/p>\n
int main()
\n{
\nint howHigh=10001;
\nint counter=1;
\nint i;<\/p>\n
while (1)
\n{
\nfor(i=3 ; ; i+=2)
\n{
\nif( isPrime(i) )
\ncounter++;<\/p>\n
if(counter==howHigh)
\n{
\nprintf("%d\\n", i);
\nreturn 0;
\n}
\n}<\/p>\n
}<\/p>\n
return 1;
\n}
\n[\/c]
\nTYPICAL OUTPUT SESSION RELATED<\/u>
\n[bash]
\n$gcc -lm tpn.c -o tpn
\n$.\/tpn
\n104743
\n$<\/p>\n
[\/bash]
\nLINKS
\nhttps:\/\/en.wikipedia.org\/wiki\/Prime_number<\/a>
\nhttps:\/\/en.wikipedia.org\/wiki\/Factorization<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
ABOUT PRIME NUMBER A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a … <\/p>\n
Continue reading “A program to find 10001st prime number ?”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[3],"tags":[1289],"_links":{"self":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/16041"}],"collection":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/comments?post=16041"}],"version-history":[{"count":0,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/16041\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/media?parent=16041"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/categories?post=16041"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/tags?post=16041"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}