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


    

GCD calculator (Euclidean algorithm)

Tabacus finds gcd(a, b) and writes out the Euclidean algorithm line by line, then works back up to express the gcd as a combination of a and b, the extended Euclidean algorithm.

Answer. gcd(252, 105) = 21

Worked solution

Euclidean algorithm, divide and keep the remainder:
252 = 2 · 105 + 42
105 = 2 · 42 + 21
42 = 2 · 21 + 0

The last nonzero remainder is 21, so gcd(252, 105) = 21.

Working back up (Bezout):
21 = (-2) · 252 + 5 · 105

Frequently asked questions

How does the Euclidean algorithm work?

Divide the larger number by the smaller and keep the remainder. Repeat with the smaller number and that remainder. The last nonzero remainder is the gcd.

What are Bezout coefficients used for?

Writing gcd(a, b) = s·a + t·b. When the gcd is 1, s is the inverse of a modulo b, which is how modular inverses and linear congruences are solved.

Related tools

All tabacus tools

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