Search Results for "prime number"

ampclib is a simple to use platform independed C++ library for arithmetic multiple precision computations with a ritch and self explaining interface. It provides number theoretic functions and primality tests. The ampclib consists of three classes: +Integer (multiple precision integers) +Rational (multiple precision rational numbers using the Integer class) +Primes (prime number computations and number theoretic functions for unsigned 32 bit integers) The latest release contains optimizations and bug fixes.

This software has four major modes- Simple, Scientific, Base & Equation. It also has Unit Converter, Date Calculator & Prime Number Generator.

VisualIntFactor will be an interactive educational and scientific tool demonstrating multiply, factor, conversion between unary counting and binary integers, all in the same grid of hexagons. This grid is based on pascals triangle, which is a 1d cellular automata that calculates (X choose Y) factorials by each cell being the sum of the 2 cells upleft and upright. Draw a binary integer from a cell going upright, then explore the allowed transforms which may lead you to a factored state in 2...

The purpose of this project is to make a prime number generator that offers many user adjustable settings and that is also very fast. While there are other prime number generators that can still beat this one in speed, no other ones that I am aware of allow the level of adjustment of sieve size that this one does. If you are running 64-bit Windows, make sure to download the 64-bit executable as it is faster than the 32-bit executable.

MuPuPriNT (Multi-Purpose Prime Number Tester) is a primality and compositeness tester for many different types of numbers. It is basic, yet full-featured, and offers several different testing methods for each type of number. MuPuPriNT is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for Windows, OS X, and Linux. Source code is available as well, and can be built on any machine with Qt installed.

The Etzold conjecture says there is an infinite number of palindromic numbers for which all prime factors are palindromic numbers as well. This projects aims to find those 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.

primedb is a project that attempt to generation prime numbers fast and saving them to a database(Mysql or else) for prime research: finding large number of prime,prime factorization,Goldbach's conjecture,twin prime conjecture...

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+.

This project is to attempt to find prime factors of a very large number. The code we are starting with uses the Eratothenes Sieve algorith and is multithreaded. We hope to get this running on a Parallel Knoppix cluster.

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.

To create an open source, fast, prime number generation and validation library.

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.