ForHosting KIT · Developer Utilities

Wilson prime checker

The Wilson prime checker answers a precise modular question from elementary number theory: given a prime p, does p squared divide (p minus one) factorial plus one?

● BetaFree · in your browser

Run — free How it works & API

Use it from WebAPIEmailTelegramApp soon

Equivalently, is (p−1)! congruent to −1 modulo p²? Wilson's theorem already guarantees that every prime satisfies the same congruence modulo p, so the Wilson-prime condition is a genuine strengthening of the modulus rather than a new kind of primality test. Supply a prime p and the tool returns p, p squared, the exact remainder of (p−1)!+1 modulo p², a boolean wilson_prime flag that is true only when that remainder is zero, and a short criterion string documenting the congruence. The classic small Wilson primes are five and thirteen; five hundred sixty-three is the only other known Wilson prime and still sits comfortably inside the supported range. The engine multiplies successive integers under a BigInt modulus, never samples randomness, never reads the clock, and never leaves the process for a network call. Use it free in the browser for homework, contest prep, and OEIS-style exploration, or call the API at $0.002 per successful request when grading scripts and library fixtures need a reproducible Wilson answer.

How to use it

Enter your values in the form above. The tool checks them before calculating and shows the result on the same page.

Check your inputs

Use the labels and units shown next to each field. If something is missing or outside the allowed range, the page points to the field to fix.

Use it again or automate it

Use the browser tool for individual checks and the API when you need the same capability in an automated workflow.

What you can do with it

Get an answer now

Enter one set of values and see the result without building a spreadsheet or script.

Compare scenarios

Change one value at a time and rerun the calculation to understand what affects the result.

Automate repeated work

Use the API when the same calculation needs to run inside your product or workflow.

FAQ

How do I use this capability?

Complete the fields above and run it on this page. The form highlights anything that needs attention.

For developers — API access

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

API endpoint

POSThttps://api.kit.forhosting.com/numth/wilson-prime

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

Call it from your stack

curl -X POST https://api.kit.forhosting.com/numth/wilson-prime \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"p":5}'

const res = await fetch("https://api.kit.forhosting.com/numth/wilson-prime", {
  method: "POST",
  headers: {
    "Authorization": `Bearer ${process.env.KIT_KEY}`,
    "Content-Type": "application/json"
  },
  body: JSON.stringify({
    "p": 5
  })
});
const { task_id } = await res.json();

import os, requests

res = requests.post(
    "https://api.kit.forhosting.com/numth/wilson-prime",
    headers={"Authorization": f"Bearer {os.environ['KIT_KEY']}"},
    json={
    "p": 5
},
)
task_id = res.json()["task_id"]

<?php
$res = file_get_contents("https://api.kit.forhosting.com/numth/wilson-prime", false, stream_context_create([
  "http" => [
    "method"  => "POST",
    "header"  => "Authorization: Bearer " . getenv("KIT_KEY") . "\r\nContent-Type: application/json",
    "content" => '{"p":5}',
  ],
]));
$task = json_decode($res, true);

body := bytes.NewBufferString(`{"p":5}`)
req, _ := http.NewRequest("POST", "https://api.kit.forhosting.com/numth/wilson-prime", body)
req.Header.Set("Authorization", "Bearer "+os.Getenv("KIT_KEY"))
req.Header.Set("Content-Type", "application/json")
res, _ := http.DefaultClient.Do(req)

Example request

{
  "p": 5
}

Example response

{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "numth.wilson_prime",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Pricing

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

Errors

HTTP	Code	Meaning
`401`	`unauthorized`	Missing or invalid API key.
`402`	`insufficient_balance`	Your balance doesn't cover the task price.
`404`	`unknown_type`	That task type doesn't exist.
`429`	`rate_limited`	Too many requests. Use the webhook instead of polling.

Read the full KIT documentation →