Search Results for "prime"
Sort By:
Showing 39 open source projects for "prime"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
1
Calculator-Scripts
Just a few scripts for pocket calculators.
Just a few applications for various pocket calculators. -
2
PeCalc
PeCalc is a polyvalent engineering calculator for S&T students
PeCalc allows making calculations with integer fractions, complex numbers, complex matrices, rational functions and complex polynomials. It also allows making changes of numeric base, prime factor decomposition, solving linear equation systems, statistical and financial computations, rational fraction decomposition and plotting some control engineering graphs. PeCalc includes comprehensive user help in English and Spanish. Currently PeCalc runs on Android and MS Windows. A version for GNU Linux is planned for the near future. ... -
3
64-bit prime test
Test 64-bit integers for pribality. Miller-Rabin, Lucas. BPSW
The code here tests 64-bit integers for primality. For 32-bit values it uses hashing and then a single Miller-Rabin test. As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people... -
4
ampclib
Arithmetic Multlple Precision Computation Library
...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. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
High Quality Super Large Prime Numbers
Utility for generating and testing prime numbers.
This utility can generate very large (and high quality) probable prime numbers as well as test for primality. -
6
Prime Numbers Generator
Attempt to create software calculating any prime number with it's nr.
-
7
UltimateCalculator
Basic Scientific Calculator
This software has four major modes- Simple, Scientific, Base & Equation. It also has Unit Converter, Date Calculator & Prime Number Generator. -
8
gmprime
GUI for Prime95 (GIMPS project)
gmprime is a gui developed in Python to work in conjunction with Prime95 software (mersenne.org) intended for users using Linux/Unix. -
9
Primenum
Calculation of Primenumbers
*Changelog: NOW AS A DEB PACKAGE! Only for Unix-and unixoid Operating Systems! (It is programmed on Linux Ubuntu 15.10) You can with the Shell- and Python Program calc prime numbers to, no: NO LIMIT (Okay, maybe the processor speed: Calculation of prime numbers to 1.000.000 prime numbers a AMD Athon II M300 goes to 90min! and by a i7 6700HQ 12min!) A installer and README is to package packed ;-) -
Atera - an All-in-one platform for IT managementYour IT essentials, integrated & elevated. Take your IT management from automated to autonomous, download Atera's agent to start your free trial!
-
10
Primes
Calculate primes by using extremely fast sorting
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. ... -
11
Mathpad
A Python based command line math utility.
Mathpad is a command line utility. It will later have a GUI, but not at this time. -
12
Visual Integer Factor
Puzzle game demonstrating whats so hard about binary integer factoring
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... -
13
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. 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. ... -
14
fastest primes
A fast prime number generator based on the Sieve of Eratosthenes
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. -
15
Then it is examined whether this number is a prime number. All computations are distributed over several computing servers. In the futer scientific computations will also become possible. The computations are supervised by a central monitor. -Active Dire
-
16
MuPuPriNT
A primality/compositeness tester for different types of numbers.
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. -
17
GJSieve
A basic prime number sieve/tester.
If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. Currently, the application differs greatly across platforms. This may change in the future. They... -
18
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.
-
19
-
20
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
-
21
A little side project that tests primality and, in future, will be able to tell how good your cpu is at number crunching.
-
22
This program minimizes boolean expressions. After combining minterms as far as possible, the program draws a chart of prime implicants which the user can easily read and manipulate to remove any remaining superfluous implicants.
-
23
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
-
24
Graph polynomials and view prime numbers on a ulam spiral graphing plot. Only integer numbers. Based on an old GPL version of the JEP equation parser. See website for additional examples/live applets Seems to be closely related to Cellular automaton.
-
25
Mad Math is a Math API for Java that is aimed at adding needed math functions and formulas that are not in the regular Java Math API, such as fibonacci sequence, is prime, area formulas, greatest common factor, least common multiple etc.
