I'm not really sure how to phrase this, so please bear with me. I need to write a program, that amongst other things, uses an "equation" (not just spitting out "1, 2, 3, 5....") to display 30 prime numbers. I don't want to "cheat" like I'm seeing some other students doing, but I'm not sure where to start. If anyone has any ideas on how to do this or where to look, I'd really appreciate it.
The only thing I can think of doing so far is testing a heck of alot of numbers by dividing by the numbers 2-11 with/without a remainder (as long as the divisor isn't the one I'm using to test), but if I do that I'm not sure how to set up the loop to display 30 numbers and just not test 30 numbers. I hope this makes sense, and ANY help/examples anyone could provide would be helpful!!!!!