This is a go implementation of Segmented Sieve and non Segmented sieve to produce prime numbers concurrently.
-
Updated
Sep 5, 2021 - Go
This is a go implementation of Segmented Sieve and non Segmented sieve to produce prime numbers concurrently.
An implementation of the AKS algorithm in Go.
Banner generator. The generated banner is a prime number.
Software to perform the LLR test, proving the primality of Riesel numbers of the form h*2^n-1.
Prime as a Service is a REST API implemented in Go that provides some of the basic functionalities using prime numbers.
My Go libs for algorithms, data structures, optimization, number theory, geometry and linear algebra. Tailored for solving Project Euler problems.
A pseudo-random iterator over numeric ranges with tiny fixed memory overhead
Generate beautiful Prime Numbers from Images
My solutions to Project Euler problems: a series of challenging mathematical/computer programming problems that require both mathematical insight and programming to solve.
Primality is a demonstrates a microservice in Go by testing various primality techniques, like Fermat, Miller-Rabin
A Go library for checking whether an integer is prime or not, using either the AKS or Miller-Rabin algorithms.
Golang program to find prime numbers in a given range. Total prime numbers and sum of all prime numbers in that given range
Go program that implements the Diffie-Hellman key exchange protocol at a 1024-bit key strength, this consists of parameter generation, share exchange, and key derivation.
Transform your internal id's to obfuscated integers based hashes
🔢 Generate prime numbers using the Sieve of Atkin
Add a description, image, and links to the prime-numbers topic page so that developers can more easily learn about it.
To associate your repository with the prime-numbers topic, visit your repo's landing page and select "manage topics."