Search Results for "prime number"
Sort By:
Showing 30 open source projects for "prime number"
View related business solutions-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
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.
-
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
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
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. -
4
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. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
5
PRPNet
A client/server application used to help in the search for primes
...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. PRPNet collects numerous stats for the clients that connect and clients can associate themselves with teams. It has a number of webpages that can be used to show current progress and statistics. It also has the ability to send e-mail when a new prime is found. Although PRPNet works well for home users with multiple cores or multiple machines, it does scale well up to a few hundred users. PrimeGrid runs most of its smaller projects on PRPNet.. PRPNet also has the ability to test for Wieferich and Wall-Sun-Sun primes. ... -
6
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. ... -
7
-
8
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. -
9
UltimateCalculator
Basic Scientific Calculator
This software has four major modes- Simple, Scientific, Base & Equation. It also has Unit Converter, Date Calculator & Prime Number Generator. -
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
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... -
11
-
12
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. -
13
Open PrimeNumber Generator
An opensource prime number generator
Open PrimeNumber Generator is a simple open source prime number generator created using C++ in Qt 5. -
14
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 . -
15
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. -
16
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.
-
17
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
-
18
-
19
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
-
20
jAlgorithms is a project mainly for educational purposes. It contains some of the popular algorithms and data structures.
-
21
...Some of the current inclusions include: Event based collections, forms with customisable titlebar buttons, enumerable generator functions with lots of predefined generators including a prime number generator
-
22
A simple java utility to check if a number can be factored or is prime, and prints the factors if they exist. This util stemmed out of a desire to make it quicker for my wife to check our son's homework, and is intended as an educational utility.
-
23
primedb is a project that attempt to generation prime numbers fast and saving them to a database(Mysql or else) for prime research: finding large number of prime,prime factorization,Goldbach's conjecture,twin prime conjecture...
-
24
This program checks whether a number is prime. You can also search for prime numbers in a range of your choice. It has a graphical user interface and it's written in C and GTK+.
-
25
Use prime numbers and pseudorandom number generators to create pseudorandom permutations to "shuffle" bits of given data (passwords, logins, PINs, files, directories). It is designed to be very secure (I hope so).
