https://github.com/rodrigodornelles/pcp-algorithm
Find large palindromic prime numbers in the decimal expansion of π (PI).
https://github.com/rodrigodornelles/pcp-algorithm
128bits nostd
Last synced: 4 months ago
JSON representation
Find large palindromic prime numbers in the decimal expansion of π (PI).
- Host: GitHub
- URL: https://github.com/rodrigodornelles/pcp-algorithm
- Owner: RodrigoDornelles
- License: agpl-3.0
- Created: 2022-08-20T01:09:03.000Z (almost 4 years ago)
- Default Branch: master
- Last Pushed: 2022-10-01T01:09:48.000Z (over 3 years ago)
- Last Synced: 2025-02-23T17:12:56.161Z (over 1 year ago)
- Topics: 128bits, nostd
- Language: C
- Homepage:
- Size: 532 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 8
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# c-palindrome-cousin-pi
> The first challenge launched by [SigmaGeek](https://sigmageek.com/) worth the prize of **U$ 2,000** (two thousand dollars),
Find large palindromic prime numbers in the decimal expansion of π (PI).
### :pick: Challenge ###
* **Tier 1** are 9 digits.
* **Tier 2** are 21 digits.
* **Tier 3** are many digits as possible.
### :toolbox: Features ###
* CI/CD
* Unit Tests
* C library itself
* CPU Multi-threading
* Task queue control
### :package: Resources ####
* Java 8
* Assembly amd64 _(linux, macos)_
* ANSI C _(without standards libs)_
* Google Storage
### ####
## Tools 1 ##
utility kit that processes data returns exact result.
### single thread ###
```
make single-run
```
#### multi thread ####
```
make multi-run
```
##### to stop #####
```
make multi-kill
```
## Tools 2 ##
a utility to explore palindrome independently.
### compile ###
```
docker run -v $(pwd):/app -w /app/tools2 -t ibmjava:8-sdk-alpine javac TierThree.java
```
### run ###
```
docker run -v $(pwd):/app -w /app/tools2 -t ibmjava:8-sdk-alpine java TierThree
```