Program to find prime numbers. EDITADD If Will Ness is correct that the questions purpose is just to output a continuous stream of primes for as long as the program is run pressing PauseBreak to pause and any key to start again with no serious hope of every getting to that upper limit, then the code should be written with no upper limit argument and a range check of true for the first i for loop. On the other hand, if the question wanted to actually print the primes up to a limit, then the following code will do the job much more efficiently using Trial Division only for odd numbers, with the advantage that it doesnt use memory at all it could also be converted to a continuous loop as per the above static void primestttulong topnumber. Console. Write. LinePrime 2. UL i lt topnumber i 2. Prime true. for uint j 3u, lim uintMath. Rome Total War Patch 1.5 Sega. Sqrtdoublei j lt lim j 2. Prime false. if is. Prime Console. Write. LinePrime 0, i. First, the question code produces no output because of that its loop variables are integers and the limit tested is a huge long integer, meaning that it is impossible for the loop to reach the limit producing an inner loop EDITED whereby the variable j loops back around to negative numbers when the j variable comes back around to 1, the tested number fails the prime test because all numbers are evenly divisible by 1 ENDEDIT. Even if this were corrected, the question code produces very slow output because it gets bound up doing 6. Tsx Nano Programming Software. L3uUwg4Q98k/Tq_6XdcEGmI/AAAAAAAAAHE/KnYv08PvMm8/s1600/Armstrong%2BNumber.PNG' alt='C Program To Display Prime Numbers Between 1 And 100 000' title='C Program To Display Prime Numbers Between 1 And 100 000' />C Program To Display Prime Numbers Between 1 And 100 ClubThe above code works because it limits the computation to only the odd numbers and only does modulo divisions up to the square root of the current number being tested. This takes an hour or so to display the primes up to a billion, so one can imagine the amount of time it would take to show all the primes to ten thousand trillion 1. ENDEDITADDAlthough the one liner kind of answer by SLaks using Linq works, it isnt really the Sieve of Eratosthenes as it is just an unoptimised version of Trial Division, unoptimised in that it does not eliminate odd primes, doesnt start at the square of the found base prime, and doesnt stop culling for base primes larger than the square root of the top number to sieve. It is also quite slow due to the multiple nested enumeration operations. It is actually an abuse of the Linq Aggregate method and doesnt effectively use the first of the two Linq Ranges generated. It can become an optimized Trial Division with less enumeration overhead as follows static IEnumerablelt int primesuint topnumber. Enumerable. Range2, inttopnumber. To. List. for int i 0 i lt cullbf. Count i. var bp cullbfi var sqr bp bp if sqr topnumber break. Remove. Allc c sqr c bp 0. SLaks answer. However, it is still slow and memory intensive due to the List generation and the multiple enumerations as well as the multiple divide implied by the modulo operations. The following true Sieve of Eratosthenes implementation runs about 3. IEnumerablelt uint primesuint topnumber. BFLMT topnumber 3u 2u. SQRTLMT uintMath. Sqrtdoubletopnumber 3u 2u. Bit. ArrayintBFLMT 1,true. BFLMT i if bufinti. SQRTLMT. for var j p p 3u 2u j lt BFLMT j p. The above code calculates all the primes to ten million range in about 7. Intel i. 7 2. 70. K 3. 5 GHz. Either of the two static methods can be called and tested with the using statements and with the static Main method as follows using System. System. Collections. System. Collections. Generic. using System. Linq. static void Mainstring args. Console. Write. LineThis program generates prime sequences. Federal government web portal for veteran owned businesses. Supports the implementation of the Veterans Entrepreneurship and Small Business Development Act of 1999. Our Discussion Boards feature has been discontinued. Amazon would like to thank the members of this community for contributing to the discussion forums. Information and assistance to all businesses wishing to do business with the Department of Veterans Affairs in particular and the Federal Government in general. Date. Time. Now. Ticks. Date. Time. Now. Ticks. Console. Write. Line. Console. Writern. Press any key to exit. Console. Read. Keytrue. Console. Write. Line. EDITADD However, in order to produce an enumeration of the number of primes less than ten thousand trillion ten to the sixteenth power as the question asks, a segmented paged approach using multi core processing is required but even with C and the very highly optimized Prime. Sieve, this would require something over 4. To do it using the un optimized Trial Division algorithm attempted, it will take super eons and a very very long time even using an optimized Trial Division algorithm as in something like ten to the two millionth power years thats two million zeros years. Tutorials/JavascriptImage/Data_Type/Number_Convert/Convert_string_with_eading_zeros_and_decimal_such_as_01_1_to_a_number_in_JavaScript_Example.PNG' alt='C Program To Display Prime Numbers Between 1 And 100 Zeros' title='C Program To Display Prime Numbers Between 1 And 100 Zeros' />Anonymous said. Q. how to find out given number is prime number or not A. Pink Floyd The Wall Zip. Note 1. The number must divisible itself or divisible by 1. LearnC. org is a free interactive C tutorial for people who want to learn C, fast. It isnt much wonder that his desktop machine just sat and stalled when he tried it If he had tried a smaller range such as one million, he still would have found it takes in the range of seconds as implemented. The solutions I post here wont cut it either as even the last Sieve of Eratosthenes one will require about 6. Terabytes of memory for that range. That is why only a page segmented approach such as that of Prime. Sieve can handle this sort of problem for the range as specified at all, and even that requires a very long time, as in weeks to years unless one has access to a super computer with hundreds of thousands of cores.