How to calculate the 100.000st prime number as fast as possible

[Pluven]

Hello,

We were doing some experiments trying to calculate the 100.000st prime number in labview as fast as possible.

Some of us got to about 7 seconds. Does anyone know a way to calculate it faster using labview?

Kev

[RavensFan]

Check out this thread Prime Factor Coding Challenge.

[GerdW]

Hi Pluven,

"Does anyone know a way to calculate it faster using labview?"

Yes, me.

~30ms (mostly for initialization) on a 4 year old Core2Duo T5500... Hint: you need to calc to roughly 1.4e7.

[Pluven]

thanks for the replys. Any chance we could see a VI of this?

Grtz

Pluv

[GerdW]

Hi Pluv,

the VI is mainly based on those Coding challenge linked by Raven's Fan...

And as this sounds like homework (or similar) I would suggest to read that old thread, read articles on Wikipedia, and then do some own coding instead of adorning with borrowed plumes... To calc primes is described in numerous places in the internet, all you need is reading and coding!

And here's you can look at my VI:

 

One correction to my first post: you only need to calc upto 1.3e6... The 100.000th prime is 1299709.

Message Edited by GerdW on 05-15-2010 01:36 PM

[Pluven]

Hi GerdW,

This actually wasn't homework, it was a challenge from a teacher after our final lessons. This might be usefull for exams but it's not an assignment.

I allready saw a couple using the same technique over & over. The old record was 17s yet we managed to improve that in a couple of hours.

So i was wondering if we could do it in a couple of hours, then experts should be able to do it alot faster ( as u said 30ms).

The reason i want to see VI's is to understand labview better. Seeing these things one way is fine, but it's when u start comparing different ways to the same problem that u rlly start learning 🙂

So thanks for the replys!

Grtz

Message Edited by Pluven on 05-15-2010 06:38 AM

Message Edited by Pluven on 05-15-2010 06:40 AM