Editorial and accuracy policy

Last updated: October 2026

Calculators

Every calculator computes its result with a deterministic algorithm that runs on our server: truth tables are enumerated, the Euclidean algorithm is carried out step by step, shortest paths are found with the stated algorithm, and so on. Results are not produced by a language model and are not looked up from a list of canned answers. Where a topic supports it, the page shows the intermediate steps so you can verify the working yourself.

Study guides, glossary and worked examples

Written material is organised the same way on every topic page: an overview, the key ideas, worked examples, common mistakes, applications and self-test questions. The numerical results in worked examples (for instance GCDs, shortest distances, transitive closures, binary-search traces and Hamming codes) are checked by an automated test that recomputes each one independently, so an example cannot silently drift out of date.

Corrections

If you find a mistake, please contact us. We verify the report, fix the calculator or text, and update the “last updated” date on the affected page.

Limits you should know about

• The site is an educational aid. It is not a substitute for a course, a textbook or your instructor. Do not rely on it as the sole check for graded work or for decisions where an error would have serious consequences.
• Some topics (for example, Hamiltonian cycles) have no efficient general algorithm, so calculators may restrict input sizes.
• Notation and conventions differ between textbooks (for example whether the height of a single-node tree is 0 or 1, or the bit order in a Hamming code). Where this matters, we state the convention we use.

Advertising and independence

The site is supported by advertising. Advertisers do not review or influence our content, and we do not publish sponsored articles. Ads are not shown on account, login or error pages.