Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB 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.
OpenPFGW is software that is designed to perform PRP and primality tests on numbers of specific forms. This software currently run on any x86 hardware with the support of George Woltman's gwnum library, the same library behind GIMPS and Prime95.
Aleph One is a highly sophisticated program for generating fractals. Some major features are: A built-in expression generator, 32-bit colouring schemes for the fractals, multi-threaded and multi-server rendering! WOW! And lots, lots more...
The source code has moved to GitLab: https://gitlab.com/jmmcg/alephone
Freemat is an interpreted, matrix-oriented development environment for engineering and scientific applications, similar to the commercial package MATLAB. Freemat provides visualization, image manipulation, and plotting as well as parallel programming.
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...
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
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
A strong, yet minimalistic Math-oriented Programming Language (MML) providing an easy-to-use console and a command-line script interpreter, targetted towards fast calculations for extremely big numbers, and bundled with a number of math libraries.
This library is meant for high performance calculations for science or 3D games/rasterizers using SIMD instructions of x86 processors to allow an unparalleled level of optimization. This takes advantage of MMX, 3DNow!, 3DNow!+/MMX+, & SSE/SSE2/SSE3/SSSE3
x86mph is an optimized library with vector, matrix, and vertex helpers (including an own TnL) It also contains memory helpers, and other stuff such as image processing (color inverting, changing bpp) taking advantage of x86's 3DNow!, MMX, and SSE
OrangeHRM provides a world-class HRIS experience and offers everything you and your team need to be that HR hero you know that you are.
Give your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
LiteOS is our attempt to write a free OS for calculators known as "TI-68k". TI naturally stands for Texas Instuments while 68k designs the Motorola 68000, in other words the processor running such calculators.
This is a port of the GNU MultiPrecision library of C arbitrary-precision arithmetic routines to IA-64, with a focus on efficient (assembly) IA-64 routines for mul_basecase.c and sqr_basecase.c
This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.