← ریاضی

Modular arithmetic toolkit

Modular arithmetic کے اہم حسابات واضح اور عملی انداز میں۔

دیگر زبانیں 日本語 | English | 简体中文 | 繁體中文 | 繁體中文(香港) | Español | Español (México) | Português (Brasil) | Português (Portugal) | Bahasa Indonesia | Tiếng Việt | 한국어 | Français | Deutsch | Italiano | Русский | हिन्दी | العربية | বাংলা | اردو | Türkçe | ไทย | Polski | Filipino | Bahasa Melayu | فارسی | Nederlands | Українська | עברית | Čeština

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 حساب کیسے کیا گیا tables export directly to CSV or shared URLs for lecture notes.

ان پٹ اقدار & tool selection

نتائج

حساب کیسے کیا گیا

    Table of intermediate steps

    Frequently asked questions

    What size of integers کیا میں 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 حساب کیسے کیا گیا?

    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.