Primes

CFB Primes is an optimised PalmOS program which can find the prime factors and closest primes of any integer number up to one billion (US) in a few seconds or less. The standard edit menu allows you to make use of the results in other applications. CFB Primes is available free of charge.

This script computes an infinite sequence of primes using simple generators. A Python dictionary is used to mark multiples of the generated primes, according to the Sieve of Eratosthenes.

CWPSieve is a CUDA-accelerated sieving program for Generalised Cullen and Woodall primes (n.b^n +/- 1). It is written by Ken Brazier, with the Mac port by Iain Bethune. CWPSieve is used by PrimeGrid's Cullen/Woodall (Sieve) sub-project.


Platforms: Mac

This program allows to convert a number from any base in any base, to decompose a number into primes and to put this number in words.


Platforms: Mac

A program to find all factors of any positive integer less than 2^31 - 2, to decompose numbers into their prime constituents, to find prime numbers and pairs of primes, and to plot Erdos-Kac and Palmen Color histograms.


Platforms: Windows

A Visual Basic application that resolves any given composite number (up to 999999999) into prime factors, gives list of primes up to 214749239, and counts primes between two given numbers (within 214749263). Form ?Euclid?: resolves any given composite number (up to 999999999) into prime factors....


Platforms: Windows

Fct_MPN_FPN_I4_Ch1_NK.zip contains the following :MPN_FPN.m : This programme creates Mersenne Prime Numbers and Fermat Prime Numbers.We are however, limited in the range here because MATLAB's isprime()is limited to only 2^32.************Prob5_Ch1_NK.m : This script describes the step-by-step...


Platforms: Matlab

Recently, Google Inc. created a few highway billboard signs asking passersby to find the first ten-digit prime within consecutive digits of e.Certainly the Mathworks File Exchange must address such a challenge!Unfortunately, the answer to the Google billboard question was quickly published in the...


Platforms: Matlab

When the natural numbers are plotted in a spiral and the primes are marked, they tend to fall on diagonal lines.(description from Galileo's Finger by Peter Atkins).


Platforms: Matlab

Genefer is a program for finding large Generalised Fermat Primes (b^2^n+1), originally written by Yves Gallot in 2001. It has since been updated by David Underbakke and Mark Rodenkirch to provide checkpointing and other features. In addition, David and Mark developed two new versions of Genefer -...


Platforms: Mac

primesieve is a free software program and C++ library that uses a highly optimized implementation of the sieve of Eratosthenes to generate prime numbers and prime k-tuplets (twin primes, prime triplets, ...) in order up to 2^64 maximum.


Platforms: Mac

Compare a variety of algorithms for generating and testing prime numbers with the pure-Python module pyprimes. Prime numbers are those positive integers which are not divisible exactly by any number other than itself or one. Generating primes and testing for primality has been a favourite...


Platforms: *nix

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory. SYNOPSIS use Math::Numbers; my $a = 123; my $b = 34; my $numbers = Math::Numbers->new($a, $b [, ...]); print "They are coprimes (relatively primes)!n" if...


Platforms: *nix

Language::Functional is a Perl module which makes Perl slightly more functional. SYNOPSIS use Language::Functional :all; print The first ten primes are: , show(take(10, filter { prime(shift) } integers)), "n"; Perl already contains some functional-like functions, such as map and grep. The...


Platforms: *nix

Bit::Vector is an efficient bit vector, set of integers and "big int" math library. CLASS METHODS Version $version = Bit::Vector->Version(); Word_Bits $bits = Bit::Vector->Word_Bits(); # bits in a machine word Long_Bits $bits = Bit::Vector->Long_Bits(); # bits in an unsigned long...


Platforms: *nix

This is an on-screen version of a game often played on middle school chalkboards. From a list of consecutive integers the student may pick any integer that still has factors "in play." The student gets that value added to his/her score, and the computer is awarded the value of all the factors of...


Platforms: Mac

This utility will interest you if you like to work with prime numbers. It has two modes. Mode A finds primes starting at a number of your choice. Mode B finds all primes between a start number and a stop number. It calculates and displays the time it takes to complete your request.


Platforms: Mac

Prime95 is a program designed to be used to find Mersenne Prime numbers. Mersenne numbers can be proved composite (not prime) by either finding a factor or by running a Lucas-Lehmer primality test. Prime numbers have long fascinated amateur and professional mathematicians. An integer greater...


Platforms: Windows

Java implementation of the RSA cryptosystem. RSA is a splitkey cryptosystem developed by Rivest, Shamir, and Adleman @ MIT in '77. RSA is thought to be secure except by factoring large primes. Jsymmetric is more proof of concept than actually useful.


Platforms: Windows, Mac, Linux

RokTextile is a Joomla! content mambot that provides Textile functionality for content. RokTextile uses TextilePHP by Jim Riggs of jimandlissa.com which in turn is a PHP implementation of the Textile shorthand syntax. Textile is used to create valid (X)HTML output without using HTML markup. It...


Platforms: Windows, *nix, PHP, BSD