Integer is prime

integer-is-prime · version 1.0.0 · Numbers & math · free, no key needed

Deterministically test whether a non-negative integer string is prime.

Use when you need to: integer is prime · primality test · check if a number is prime.

Supported

• integer is prime
• primality test
• check if a number is prime

Not supported

• negative primality
• probabilistic primality
• prime factorization

Behavior

• value is a canonical non-negative integer string: 0 or a non-zero leading digit followed by digits, at most 24 digits.
• Negative values are rejected; primality is only defined here for non-negative integers.
• 0 and 1 are not prime; the result is false for both.
• Primality is decided by deterministic Miller-Rabin with witnesses {2,3,5,7,11,13,17,19,23,29,31,37}, which is proven exact for every value below 3317044064679887385961981 (~3.3e24); the 24-digit input cap keeps every accepted value inside that proven range.
• The result is a JSON boolean, never probabilistic.

Input

• value (string, required): max length 24; pattern ^(0|[1-9][0-9]*)$

Output

• is_prime (boolean, required)

Limits

• max digits: 24

Example

Request input:

{
  "value": "997"
}

Response:

{
  "result": {
    "is_prime": true
  }
}

How to call it

MCP

Connect https://computefirst.net/mcp (setup), then call execute with:

{
  "id": "integer-is-prime",
  "version": "1.0.0",
  "input": {
    "value": "997"
  }
}

HTTP (no key)

curl -X POST https://computefirst.net/v1/tools/integer-is-prime/versions/1.0.0/execute \
  -H "Content-Type: application/json" \
  -d '{"value":"997"}'

The machine-readable contract is at /v1/tools/integer-is-prime/versions/1.0.0.

CLI

node cli.mjs run integer-is-prime 1.0.0 --input input.json --base-url https://computefirst.net

Get the client at /clients/cli/.

Related tools

• Integer is perfect square: Test whether a non-negative integer string is a perfect square.
• Integer divisors: List every positive divisor of a positive integer, ascending.
• Array integer GCD: Compute the non-negative greatest common divisor of an array of canonical integer strings.
• Array integer LCM: Compute the non-negative least common multiple of an array of canonical integer strings.
• Integer catalan number: Compute the nth Catalan number exactly.
• Integer digit sum: Sum the base-b digits of the magnitude of an integer string.