My solutions to some Project Euler problems. Emphasis on elegance (where possible) and performance.
-
Updated
Sep 25, 2024 - Rust
My solutions to some Project Euler problems. Emphasis on elegance (where possible) and performance.
A Rust program that attempts to solve Goldbach's Conjecture, which states that every even integer greater than 2 can be expressed as the sum of two prime numbers.
Various number theory related functions (prime checking, integer factorization, etc.)
Add a description, image, and links to the sieve-of-atkin topic page so that developers can more easily learn about it.
To associate your repository with the sieve-of-atkin topic, visit your repo's landing page and select "manage topics."