Search Results for "mersenne"
Sort By:
7 projects for "mersenne" with 2 filters applied:
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
mers
Portable software and data related to Mersenne numbers
Portable software related to Mersenne numbers. Useful to automate certain tasks related to GIMPS (www.mersenne.org) for computers that cannot run the GIMPS software for whatever reason. Much of the code has been in use since 1990 or so by a few people. The project web site at https://mers.sourceforge.io/mersenne.html has data about Mersenne numbers from many people generated by this and other software, notably from the GIMPS project. -
2
Statistics for MySQL
Add more statistical functions to MySQL.
"Statistics for MySQL" provides additional statistical functions (like Pearson's coefficient of correlation) which are missing in MySQL. DLLs for 32 and 64bit Windows as well as makefiles for Linux are available. -
3
RandomLib
Random number library
RandomLib is a C++ interface to the Mersenne Twister random number generator MT19937 and to the SIMD-oriented Fast Mersenne Twister random number generator, SFMT19937. For documentation, visit http://randomlib.sf.net -
4
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
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. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible
-
6
Simd oriented Fast Mersenne Twister Random generator for Cell processor This library is an implementation of the SFMT http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/ The objective is to create a fast pseudo-random generator for the Cell Processor
-
7
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
- Previous
- You're on page 1
- Next
