way to store and find the sum of prime numbers in a loop from 1 to an arbitrary N value

[farrukh1976]

i am intrested in a program in labview 8.5 to find out successive prime numbers between 1 to an arbitrary number N given as input and find out their sum as out put on front panel.

[RavensFan]

Very nice to hear that!

Spoiler

If you have a specific question about how to do that, then I suggest you actually ask a question in your message.

[jcarmody]

Is this a homework assignment?

Spoiler

Here's how I did it. 

[farrukh1976]

thanks. yes that was a part of an assignment.

[smercurio_fc · Accepted solution]

Well, OK, then. Some honesty. That's actually quite refreshing. So what have you tried so far? We can offer tips and guidance, but you're not going to get us to do your homework for you. Do you have an algorithm? Do you know how to determine if a number is prime? Start with something simple. Figure out how to store a running sum in a loop. Not too hard. Hint: Shift register (or, for newer versions of LabVIEW, Feedback Node)

[farrukh1976]

I am studying here in korea as doctoral student. the problem iam facing here is that the text book for Labview being followed here in korean language and because of that i am not been able to understand the software properly. how can i get an english version of Labview 2009 text book?

[WayneS1324]

You order it from the internet.