https://github.com/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.
https://github.com/taeh98/prime-numbers
bigdecimal bigdecimal-utils biginteger bignumber java java-8 java8 maths prime-numbers primes
Last synced: 2 months ago
JSON representation
A program to print/save (to a text file) all prime numbers or the next prime number after a given input start number.
- Host: GitHub
- URL: https://github.com/taeh98/prime-numbers
- Owner: taeh98
- Created: 2017-10-21T23:52:52.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2017-12-03T05:59:43.000Z (over 7 years ago)
- Last Synced: 2023-07-24T15:26:01.857Z (almost 2 years ago)
- Topics: bigdecimal, bigdecimal-utils, biginteger, bignumber, java, java-8, java8, maths, prime-numbers, primes
- Language: Java
- Size: 5.86 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
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.