I managed to "borrow" a copy of VB from a friend since what I need to do is very impracticle in qbasic: I need to write a program to generate a list of prime numbers between 2 and x and work for middle to large values of x, say 30,000 to 50,000,000 The most "efficient" way I can think of that involves a minimal of mathematical abstracts is like this (in pseudo programming language) f=0 input x for i=2 to x output x to prime.lst next x 10 let y be the next number in prime.lst (starting with 2) if f=y then end i=y to x z=y if floor(i/z)=i/z then remove value of i from the list. next i let f=i goto 10 what it does is generate a list of numbers. then starting with 2, eliminates all multiples of that number. so say I wanted a list of all primes between 1 and 16. heres what the program would do: it'll write out 2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 then it'll start with 2, and check each number to see if its a multiple of 2 which at the end of that step, the list would look like 2,3,5,7,9,11,13,15 then it would take the next number in the list, 3 and remove its multiples, so your list looks like: 2,3,5,7,11,13 and it will continue doing the same thing with 5,7,11,... until the end of the list. at which point the list needs to be exported to a text file so that I can then print it out. I need this program to work for finding all the primes between 1 and 30,000. I am no programmer, and any help will greatly be appreciated.