Tahanan / Mga kalkulador / Modular arithmetic

Modular Arithmetic Suite (Extended GCD, inverses, CRT)

Run extended Euclid, modular inverses, fast power, CRT merges, and linear congruences with BigInt precision, while How it’s calculated records every quotient, coefficient, and merge step for review.

Iba pang wika: ja | en | zh-CN | es

The suite keeps a single state for extended Euclid, so you can confirm gcd, Bézout coefficients, inverses, or linear congruence solutions without retyping numbers. Fast power uses binary exponentiation logs, and CRT supports both coprime and non-coprime moduli with compatibility checks.

Each tool is screen-reader friendly via `role="status"` and `role="alert"`, while How it’s calculated tables export directly to CSV or shared URLs for lecture notes.

Inputs & tool selection

Results

How it’s calculated

    Frequently asked questions

    What size of integers can I enter?

    Every field is parsed as a JavaScript BigInt, so you can work with negative values and very large integers. Only the modulus must be a positive integer.

    What appears in How it’s calculated?

    You will see the extended Euclid quotient table, the coefficients used for inverses, the res/base/exp trail for fast power, each CRT merge step, and the reduction path for linear congruences. All of it can be exported as CSV.