taeh98/prime-numbers

A program to print/save (to a text file) all prime numbers or the next prime number after a given input start number.

This project is a program which will print or save (to a text file) all prime numbers in order, or the next prime number after a given input number. I am trying to do this as efficiently as possible (in Java in this repo - I might move to another, more efficient language in another repo to absolutely optimise efficiency). To run the program, all you need to do is download the repo, then compile all Java source files. Run the compiled PrimeNumbers class in a CLI and follow instructions there. If you can see any ways of improving efficiency, flag it in an issue or feel free to just fork then submit a pull of the fix.

prime-numbers's Issues

Add printing

Still need to add printing output to a text file (definitely for printing all prime numbers - maybe next after given start point too?).

Process will probably be: clearing output file, putting run timestamp and IP when starting, then just appending file at same time as (or not) printing to CLI, then opening file once done.

Efficiency and implementing stuff

I need to try to find a way of finding prime numbers efficiently using the current mathematical methods and operations in my Java source file and any other new ones I can find and implement - especially for a new third mode, finding any prime number after (greater) a given number input.

Todo:

• enable saving the output to a file along with or in place of printing
• implement this new third mode with maximum efficiency for current methods implemented
• alter existing ones to maximise efficiency (minimise the time taken)