A parallelized prime number generator written in C.

Go to file

Nicolás A. Ortega f8726497a4 Don't test for divisibility by 2. We skip all even numbers, so we can skip 2, this also means giving 3 as a given.		2016-12-30 17:57:28 +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	Don't test for divisibility by 2.	2016-12-30 17:57:28 +01:00
.gitignore	Enable documentation.	2016-12-14 16:08:11 +01:00
.gitlab-ci.yml	Added OpenMP to CI.	2016-12-26 16:35:52 +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	Fixed title for v0.7	2016-12-27 22:53:22 +01:00
CMakeLists.txt	Moving file I/O to own file. Everything works except export.	2016-12-26 18:50:51 +01:00
CONTRIBUTING.md	Initial commit.	2016-11-30 14:32:06 +01:00
Doxyfile	Fixed something from the description	2016-12-14 16:14:37 +01:00
LICENSE	Initial commit.	2016-11-30 14:32:06 +01:00
README.md	Now using OpenMP for parallel programming and next version is v1.0	2016-12-26 15:57:28 +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
OpenMP

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.