ForHosting KIT · Developer Utilities

Integer parity checker

Integer parity checker: enter your values and see a clear result on this page. Free for individual checks; API from $0.002.

● BetaFree · in your browser
Use it from WebAPIEmailTelegramApp soon

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.

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.

How does the integer parity checker decide even vs odd?

It counts the one-bits in the binary form of |n| (popcount) and reduces modulo 2. Even ones_count → parity even and parity_bit 0; odd ones_count → parity odd and parity_bit 1.

What happens with negative integers?

The original signed n is echoed, but bit work uses the absolute value (magnitude). Negative thirteen has the same ones_count and parity as thirteen. No two's-complement width is assumed.

Is this the same as asking whether n is an even number?

No. Decimal even/odd looks only at divisibility by two. Set-bit parity looks at how many 1-bits appear in the binary expansion. Example: 2 is an even number but binary 10 has one set bit (odd parity).

How is this different from a parity-bit calculator or Thue-Morse bit?

A parity-bit tool appends or verifies a parity bit on an arbitrary bit string or byte. Thue-Morse names the sequence t(n)=popcount(n) mod 2 for non-negative indices. This checker targets integer set-bit parity for general coding and error-detection checks, including signed magnitude handling and diagnostic fields.

What does the integer parity checker cost?

The browser tool is free. API requests use prepaid KIT balance at $0.002 per successful call; invalid input is not billed.

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.

POSThttps://api.kit.forhosting.com/dev/integer-parity

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.

curl -X POST https://api.kit.forhosting.com/dev/integer-parity \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"n":13}'
{
  "n": 13
}
{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "dev.integer_parity",
  "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.

Per request$0.002

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

HTTPCodeMeaning
401unauthorizedMissing or invalid API key.
402insufficient_balanceYour balance doesn't cover the task price.
404unknown_typeThat task type doesn't exist.
429rate_limitedToo many requests. Use the webhook instead of polling.

Read the full KIT documentation →