2e763990 · zzmq.dev@gmail.com/mathkit

Commit

2e76399025e6749af5719ab2ab993791882a8c00

Implement Euclidean algorithm for GCD, add corresponding test suite, and update index exports to include gcd

zzmq.dev@gmail.com[dev2] <zzmq.dev@gmail.com[dev2]@local> -- 2026-10-15T05:31:27.000Z

Ladder Summary

Added a Euclidean‑algorithm implementation of GCD with comprehensive tests and exported it from the main index, extending the library’s numeric utilities.

← prev 95d776e8 next 9271926f →

Tree at this commit

📄 README.md
📄 index.js
Ladder Summary
Serves as the library’s public API entry point, re‑exporting utility functions such as `sum`, `isOdd`, `isEven`, `min`, `isPrime`, `factorial`, `clamp`, `mean`, `median`, `isPerfectSquare`, and now includes the newly added `gcd` function from `src/gcd.js`.
📁 src
📁 test