Displaying 1 to 17 from 17 results

Primalogy System

  •    

Primalogy is a new numerology system for the Quran derived from the Quran’s Opener chapter, The Key.

Prime Calculator

  •    

PrimeCalculator factorizes a number or a math expression into its prime factors or if prime display its prime type [Unit, Prime, Additive, Pure].

Prime Factorization

  •    

Factoring trinomials using the ac method can be made easier through the use of Prime Factorization. Prime Factorization is a program that can assist you in the factoring of numbers in Algebra, namely trinomials using the AC Method. It can also find all the factors of any number.




miller-rabin - The Miller-Rabin probabilistic primality test in C++ w/GMP

  •    C++

The Miller-Rabin primality test is a probabilistic algorithm for determining if a number is prime or not. By its probabilistic nature, it runs fast --- in O(k log3 n) time --- but there is a chance for false positives; it can report that a number is prime while it is not. False negatives are impossible, though. If it reports a number is composite, it is.

pyalgo - Algorithms in Python Anagram, Bubblesort, Quick, Merge, Binary, Babil, E Number, Fibonacci, Insertion, Golden Ratio, Hamming Numbers, Mersenne Primes, Levenshtein, Perfect Number, Prime Numbers, Sift3, Shell, Tree Node, Vertex, Graph

  •    Python

Algorithms in Python Anagram, Bubblesort, Quick, Merge, Binary, Babil, E Number, Fibonacci, Insertion, Golden Ratio, Hamming Numbers, Mersenne Primes, Levenshtein, Perfect Number, Prime Numbers, Sift3, Shell, Tree Node, Vertex, Graph

primebanner - Banner generator. The generated banner is a prime number.

  •    Go

PrimeBanner is a banner generator. The results are banners where the number values are prime. Today, i saw a tweet from Fermat’s Library. And i thought, why not? Then i wrote this program to generate my own prime banners.


Primes.jl - Prime numbers in Julia

  •    Julia

Julia functions for computing prime numbers.

prime - This is a go implementation of Segmented Sieve and non Segmented sieve to produce prime numbers concurrently

  •    Go

This is a Go library to produce prime numbers using all available cpu cores. Performance depends on the size of max number. But as an example, it needs about 3ms to produce the first 1,000,000 prime numbers.

primal - primal puts raw power into prime numbers.

  •    Rust

primal puts raw power into prime numbers. This uses a state-of-the-art cache-friendly Sieve of Eratosthenes to enumerate the primes up to some fixed bound (in a memory efficient manner), and then allows this cached information to be used for things like enumerating and counting primes.

Swift-MathEagle - A general math framework to make using math easy

  •    Swift

MathEagle is named after the golden eagle, since this is the fastest bird in the world (in horizontal flight). MathEagle is still in its initial development phase so the syntax still changes frequently.

coqprime - Prime numbers for Coq

  •    Coq

The library was previously maintained here. Use primo to generate a cerficiate file.out. Here is a certificate for 1234567890123456789012353.

BigIntegerCPP - A C++11 large integer library with effective high performance, simplistic in nature and also clean in the eyes

  •    C++

BigIntegerCPP is a C++11 port of large integer library used in CryptoLib4Pascal. It allows mostly parsing of numbers as strings in different bases (2, 8, 10 & 16) and converting them back to string, also in different base as stated above. The advantages of this library is its simplistic nature and cleanliness of code. Here is a sample of code which uses BigIntergerCPP to calc 2^20.

IntXLib4CPP - IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation

  •    C++

IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation. It provides all the basic arithmetic operations on Integers, comparing, bitwise shifting etc. It also allows parsing numbers in different bases and converting them to string, also in any base. The advantage of this library is its fast multiplication, division and from base/to base conversion algorithms. all the fast versions of the algorithms are based on fast multiplication of big Integers using Fast Hartley Transform which runs for O(N * log N * log log N) time instead of classic O(N^2). As you can see, IntX implements all the standard arithmetic operators using operator overloading so its usage is transparent for developers, like if you're working with usual Integers.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.