Search Results for "prime number"

[Versione in italiano sotto] This program can be used to find the prime numbers between 1 and a given number. Also the primes can be visualized in the form of Sieve of Eratosthenes with six columns. The sieve is created in Html and it is possible to save it in a file so that it can be opened with any other browser also after the program was closed. If the browser has the support for JavaScript, it should be possible to show the factorization of a non prime number clicking on it. ...

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.

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

Several scripts for a variety of useful math functions.

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

...Some of the current inclusions include: Event based collections, forms with customisable titlebar buttons, enumerable generator functions with lots of predefined generators including a prime number generator

A simple java utility to check if a number can be factored or is prime, and prints the factors if they exist. This util stemmed out of a desire to make it quicker for my wife to check our son's homework, and is intended as an educational utility.

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

Use prime numbers and pseudorandom number generators to create pseudorandom permutations to "shuffle" bits of given data (passwords, logins, PINs, files, directories). It is designed to be very secure (I hope so).

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.