Search Results for "prime number"
Sort By:
Showing 15 open source projects for "prime number"
View related business solutions-
Earn up to 16% annual interest with Nexo.Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
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
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). Surprise, same code in JavaScript for M2 chip... -
2
mtsieve
A multi-threading framework using a prime sieve to do work
...Another usage could be to use those prime numbers to test each for a specific characteristic, such as whether it is a Wieferich or Wall-Sun-Sun number. The framework is portable to any OS running on x86-64 and supports GPUs. -
3
Polymeter
Polymeter MIDI sequencer
Polymeter is a MIDI sequencer for music that's in multiple prime meters (2, 3, 5, 7, 11, etc.) simultaneously. Each track has its own loop length, and when the lengths differ, the tracks "slip" (or shift phase) relative to each other. The resulting interference pattern is sufficiently intricate that variations similar to the embellishments of a live performer can be generated algorithmically. The current project is based on software I developed in the 1990s in order to compose... -
4
ampclib
Arithmetic Multlple Precision Computation Library
ampclib is a simple to use platform independed C++ library for arithmetic multiple precision computations with a ritch and self explaining interface. 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. -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
Prime Numbers Generator
Attempt to create software calculating any prime number with it's nr.
-
6
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. -
7
HugeCPPNum
definition huge integer number with 300 digits in cpp
this project is huge integer number for my data structure course . it use array with 300 element it s better use queue instead if it .i define * - + % for integer number . in cryptography course i'm use it for Miller and Robbin prime test and add qiuck power to it . -
8
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. -
9
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... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
10
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.
-
11
EpLibrary
Visual C++ Utility Library
* EpLibrary project in this site is not maintained anymore. * The project has been moved to https://github.com/juhgiyo/EpLibrary EpLibrary is a utility library for Visual C++. The features includes: - Math Framework - Enhanced Binary Search - Sort - Stream Framework - Container Framework - Simple Debugger Framework - FileSystem Framework - Other Frameworks - Server/Client Template Framework - System Framework - Thread System For detailed documentation,... -
12
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
-
13
This project is to attempt to find prime factors of a very large number. The code we are starting with uses the Eratothenes Sieve algorith and is multithreaded. We hope to get this running on a Parallel Knoppix cluster.
-
14
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.
-
15
- Previous
- You're on page 1
- Next
