tabacus

Welcome to tabacus!

Thanks for trying out our beta!

As a sign of our gratitude, we've given you free access to all Pro features for the duration of the beta, and you'll get an exclusive discount when the app is fully released.

Expect frequent updates and fixes. We're working hard to make the app as good as possible, so any feedback is highly appreciated!

By using tabacus you agree to the Terms of Service and Privacy Policy.

Send feedback

Your profile

A square crop is kept, 256 × 256.
Change password

Leave both blank to keep your password. You don't need your old one: choose a new password here and save. Never set one? This sets it.

Clear this sheet?

You can undo it for a few seconds afterward.

Delete your account?

This permanently deletes the account and everything saved to it: your synced sheets, equations, materials and constants, your profile and picture, saved files, and connected AI apps. It can't be undone.

The work open in this browser stays here.

Save document

Open a document

Draw a molecule

Click an atom to grow a chain, drag from it to draw a bond, click a bond to make it double or triple. Keys: C N O S, 1 2 3 for bonds, B for benzene, E to erase.

Export this tab


    

Modular inverse calculator

The inverse of a modulo n is the number x with a·x ≡ 1 (mod n). Tabacus solves that congruence, checks that gcd(a, n) = 1 so an inverse exists, and shows the steps.

Answer. x ≡ 38 (mod 43)

Worked solution

Solve 17x ≡ 1 (mod 43).

Here a = 17, n = 43, and gcd(a, n) = 1.
Since gcd(a, n) = 1, there is exactly one solution modulo 43.
The inverse of 17 modulo 43 is 38 (since 17·38 ≡ 1 (mod 43)).
So x ≡ 1·38 ≡ 38 (mod 43).

Solutions mod 43:  x ≡ 38  (mod 43).

Frequently asked questions

When does a modular inverse exist?

Exactly when gcd(a, n) = 1. For example 4 has no inverse mod 10, because gcd(4, 10) = 2.

How do you check the answer?

Multiply and reduce: 17 · 38 = 646 = 15 · 43 + 1, so 17 · 38 ≡ 1 (mod 43).

Related tools

All tabacus tools

The calculator above is already loaded with this problem, edit it or type your own.