@Sourav: What you are missing is that the algorithm is a manual one that will answer the question asked in a few moments without writing any computer code. Looking in the first file, you find that there are 1229 prime numbers less than 10,000. Looking in the second file, you find that the sum of the first 1229 prime numbers is 5,736,396. It all takes less than a minute. Why do you need code when you can answer the question so simply without it?
Dave On Sep 27, 6:54 am, sourav <souravs...@gmail.com> wrote: > @Dave > > I cannot see any code at the links you have provided. I only see the > prime numbers. am I missing something here..? > > Thanks, > Sourav > > On Sep 23, 10:59 pm, Rishi Agrawal <rishi.b.agra...@gmail.com> wrote: > > > > > Apart from 1, 2 and 3, all the prime numbers are either of the form (6*n - > > 1) or (6*n + 1). > > > Can we use this property to generate the primes till we get 10000 primes.- > > Hide quoted text - > > - Show quoted text - -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
