Primzahlen Suchen mit der Formel des Mathematiker Pierre de Fermat.
-
Updated
Sep 19, 2018 - C#
Primzahlen Suchen mit der Formel des Mathematiker Pierre de Fermat.
A C# console application calculating prime numbers continuously and storing them in text files.
Console application that uses the seive of Eratosthenese to find prime numbers between 1 and a number selected by the user
Finds all prime numbers below the input value
1bpp bit map image physically compression
Primzahlen Suchen mit der Formel des Mathematiker Pierre de Fermat. (WinForms)
Primzahlen Suchen mit der Formel des Mathematiker Pierre de Fermat. (WinForms)
Prime-Generator Csharp
Abelian Finite Groups decomposition
Small CLI app that will check a user's input to see if it is a prime number.
My Implementation of some algorithms in C#
A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
C# : Nombres premiers avec crible d' Atkin et Eratosthène et test de primalité Miller Rabin ( C #: Prime numbers with Atkin and Eratosthenes sieve and Miller Rabin primality test )
The hardest "What comes next?" (Euler's pentagonal formula)
Contains some functionality regarding primes and base-n representation of numbers.
MohammadMahdiPalvaye
A fun way to check for prime numbers!
1. 1(3)+2(3)+3(3)+...n find sum series
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."