A pseudo-random iterator over numeric ranges with tiny fixed memory overhead
-
Updated
Nov 20, 2017 - Go
A pseudo-random iterator over numeric ranges with tiny fixed memory overhead
Generate beautiful Prime Numbers from Images
A Go library for checking whether an integer is prime or not, using either the AKS or Miller-Rabin algorithms.
Ever wanted to find billions of prime numbers. In a rather inefficient manner, however wrapped in loads of fancy stuff with no graphics? Well now you can! All because I was learning Golang and wanted some thing to code! PrimeFinder!
Go utility package for working with prime numbers
A Golang Program to Create Prime Bitstrings 100100010000010000000100000000000100000000000001 or Hex Encoded Bigints that can be converted back to the Primes
Solving project euler problems using Golang
Primality is a demonstrates a microservice in Go by testing various primality techniques, like Fermat, Miller-Rabin
This Elgamal variant will use a hash function (SHA256) to compute a key for the AES-GCM encryption scheme.
Golang program to find prime numbers in a given range. Total prime numbers and sum of all prime numbers in that given range
Prime number visualisation
My solutions to Project Euler problems: a series of challenging mathematical/computer programming problems that require both mathematical insight and programming to solve.
🔢 Generate prime numbers using the Sieve of Atkin
A simple implementation of Miller-Rabin to explore the math (less efficient than the version in the standard library)
A set of sieves for prime numbers written in Go
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."