Search Results for "prime"

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. ...

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. ...

This is a simple application that give to the user the possibility to know prime numbers.

libNT is a Number Theory Library which is based on a BigInteger Class. It will contain several algorithms for solving Number Theory Problems. Written in the IDE Code::Blocks

Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.

This program checks whether a number is prime. You can also search for prime numbers in a range of your choice. It has a graphical user interface and it's written in C and GTK+.

WinS (Wins Is Not Serious) is not another MatLab. Now it can only find prime numbers, in an interval, beep when it find twin primes, print the maximum distance found between two consecutive prime numbers.

Searches for prime numbers within a given range and outputs in a format proper for uploading.

RSA-IP is a Linux kernel net _protocol_ which encrypts IPv[4;6] using RSA public/private key.Think of it as a kernel level implementation of ssl. RSA needs prime number so we release a prime searcher.

Algomath is a portable 32bit integer Arithmetic C Library with prime numbers and numbers manipulation algorithms. Optional fast assembly language alternatives (NASM source) for prime numbers time-critical functions are also included for the Intel-x86 rang

The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.