Showing 18 open source projects for "prime"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    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.
    Start Free
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

    Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
    Claim $300 Free
  • 1
    Calculator-Scripts

    Calculator-Scripts

    Just a few scripts for pocket calculators.

    Just a few applications for various pocket calculators.
    Downloads: 7 This Week
    Last Update:
    See Project
  • 2

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    UltimateCalculator

    UltimateCalculator

    Basic Scientific Calculator

    This software has four major modes- Simple, Scientific, Base & Equation. It also has Unit Converter, Date Calculator & Prime Number Generator.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    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.
    Try free now
  • 5

    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.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 6

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    MuPuPriNT

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    GJSieve

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure Icon
    Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure

    Native application identity and user-based security for your Azure cloud

    Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
    Get a free trial
  • 10
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    Searches for prime numbers within a given range and outputs in a format proper for uploading.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Algomath is a portable 32bit integer Arithmetic C Library with prime numbers and numbers manipulation algorithms. Optional fast assembly language alternatives (NASM source) for prime numbers time-critical functions are also included for the Intel-x86 rang
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    To create an open source, fast, prime number generation and validation library.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo