Search Results for "prime numbers"
Sort By:
Showing 70 open source projects for "prime numbers"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
Primes.jl
Prime numbers in Julia
Julia functions for computing prime numbers. -
2
numbers-java
Java library for number operations
Java library for number operations currently consisting of PrimeFactors.java, which calculates prime factors for a given integer -
3
White Wizard's prime numbers
Prime Numbers Algorithm without need of arrays
n=a^2-b^2=(a+b)*(a-b) n+b^2=a^2 n is a prime number if only a=b+1 else is not -
4
mtsieve
A multi-threading framework using a prime sieve to do work
mtsieve is a framework wrapped around primesieve to distribute prime numbers to worker classes to do work with those prime numbers. The "mt" means that it is multi-threaded. The "sieve" means that the framework is typically used to eliminate candidate terms with small from a set of numbers. The numbers remaining after using mtsieve can then be used by programs such as llr and pfgw to test those numbers for primality. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
5
Prime number ( primenumbers )
Benchmark for 50 000 000 prime numbers as single and multicore
Simple source files and compiled JAR Java programs, for benchmark 50 000 000 cycle finding prime numbers. On Intel(R) Core(TM) i5-8600K CPU, Windows 10 20H2, i have 39 second on single core and 7,6 second on multi core. (PS: C++ multicore 6 second). Added C files for gcc compiler in Windows 10 and for Xcode C command line project in MacOS ( tested on Mac mini M2 with single core 16 to 25 sec and multicore 2,3 to 5 second by compiler -O switch). -
6
Optimus id transformation
Id obfuscation based on Knuth's multiplicative hashing method for PHP
...It is similar to Hashids but will generate integers instead of random strings. It is also super fast. If you will be running your code on a 32-bit system or will be working with large prime numbers it is suggested that you install the GMP extension. -
7
ListPrimeNumbers
Listing Prime Numbers.
Project using simple deterministic algorithms to check whenever any number in the range 0 to 18,446,744,073,709,551,615 is a prime number. -
8
PRPNet
A client/server application used to help in the search for primes
The PRPnet server is an application that manages a list of numbers for which the primality is unknown. PRPNet clients connect to the server to get one or more candidates on which a primality test is needed. The server ensures that only one client at a time is testing any particular candidate and then captures the results of the test and records that information in a MySQL or PostgreSQL database. -
9
Kalker
scientific calculator math syntax user-defined functions kalker
Scientific calculator with math syntax that supports user-defined variables and functions, complex numbers, and estimation of derivatives and integrals Features Operators: +, -, *, /, !, % Groups: (), [], ⌈ceil⌉, ⌊floor⌋ Vectors: (x, y, z, ...) Matrices: [x, y, z; a, b, c; ...] Pre-defined functions and constants User-defined functions and variables Root finding using Newton's method (eg. x^2 = 64). Note: estimation and limited to one root Derivation (prime notation) and integration (eg. integral(a, b, x dx) The value of an integral is estimated using Simpson's 3/8 rule, while derivatives are estimated using the symmetric difference quotinent (and derivatives of higher order can be a bit inaccurate as of now) Complex numbers Understands fairly ambiguous syntax (eg. 2sinx + 2xy) Syntax highlighting Piecewise functions: , pressing enter before typing the final "}" will make a new line without submitting. ... -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
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. -
11
Eratostene
Show the prime numbers in the form of the Sieve of Eratosthenes
[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. ... -
12
-
13
Mersenne Prime Finder
Finds Mersenne Prime Numbers Automatically
Finds Mersenne Prime Numbers Automatically. The code was designed in Python -
14
Prime Factorization
Prime Factorization Calculator
Program that allows the prime factorization of a given number. For example 12 = 2 * 2 * 3 Useful in rapidly solving the largest common divisor or the smallest common multiple of two numbers. Link: FactorialNumar.apk The program works only on Android operating system. -
15
RSA Encryption Tool
RSA algorithm based encryption tool.
A simple program written in C# utilizing .NET 4.6 to demonstrate RSA encryption in action. User can select a text file or input any text to encrypt. -
16
Number Theory
A collection of functions to calculate basic number theory constructs.
An APL workspace to calculate basic number theory constructs such as prime and amicable numbers. -
17
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. -
18
ampclib
Arithmetic Multlple Precision Computation Library
...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. -
19
Primfaktorzerlegung-sehr-grosse-Zahlen
Prime factorization for very big numbers!
- Prime factorization for very big Numbers! - Primfaktorzerlegungs Programm für sehr grosse Zahlen! - C# WinForms Topics: Primzahlen prime primes Primfaktorzerlegung Faktorisierung Faktorisieren -
20
Primfaktorzerlegung-grosse-Zahlen
Prime factorization for big numbers! Up to 29 digits
- Prime factorization for big Numbers! - Primfaktorzerlegungs Programm für grosse Zahlen! - C# WinForms Topics: Primzahlen prime primes Primfaktorzerlegung Faktorisierung Faktorisieren -
21
Prime Numbers Generator
Attempt to create software calculating any prime number with it's nr.
-
22
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 ;-) -
23
primegen
Prime-gen tools
This is an education set of tools to research, display and use prime numbers. -
24
PrimeCalculator
Ein Programm, um Primzahlen zu berechnen. A Programm to calculate
Ein Programm, um Primzahlen zu berechnen. A Programm to calculate prime numbers. -
25
Passwords generator for IAD devices, using 3 keys and a index. The result is a fixed lenght of alphabetic characters. The algorithm works with other 3 big fixed prime numbers. These 3 numbers define a family of passwords. Finally, it provides a guaranteed functional string to use in all variety of devices without rejects.
