A parallelized prime number generator written in C.

Go to file

Nicolás A. Ortega 06d5ddb0cc Fixed problem with the algorithm. If it's equal to half then we want to check if it's divisible, since if it's half then it is NOT prime.		2016-12-13 18:05:02 +01:00
build	Initial commit.	2016-11-30 14:32:06 +01:00
cmake	GMP is a new dependency.	2016-12-02 16:31:12 +01:00
src	Fixed problem with the algorithm.	2016-12-13 18:05:02 +01:00
.gitignore	Added Vim swap files to gitignore.	2016-11-30 20:34:06 +01:00
.gitlab-ci.yml	Cache the right .o files.	2016-12-10 17:43:31 +01:00
astyle.cfg	Initial commit.	2016-11-30 14:32:06 +01:00
AUTHORS.md	Initial commit.	2016-11-30 14:32:06 +01:00
CHANGELOG	New goal for v0.4	2016-12-13 17:51:48 +01:00
CMakeLists.txt	Switch to C, stop using OpenMP, start using GMP.	2016-12-09 23:02:51 +01:00
CONTRIBUTING.md	Initial commit.	2016-11-30 14:32:06 +01:00
LICENSE	Initial commit.	2016-11-30 14:32:06 +01:00
README.md	Switch to C, stop using OpenMP, start using GMP.	2016-12-09 23:02:51 +01:00

README.md

Indivisible

Indivisible is an optimized prime number generator written in C.

Building

There are multiple dependencies to install before compiling the project:

CMake
GMP

Once the dependencies are installed you can compile by running the following from the root directory of the project:

$ cd build/
$ cmake ..
$ make

To build a release build run cmake -DCMAKE_BUILD_TYPE=Release .. instead.

Contributing

If you would like to contribute to Uhn then please read the contributing file before creating a merge request.

License

This project is licensed with the GNU GPLv3. Since it is an educational project I find it very important that all contributions continue to remain free/libre.