math.gcd-lcm
Greatest common divisor and least common multiple of two integers, exactly and without overflow.
1.0.0 (not the latest) · published 2026-10-03 by charlie · Anterra
Pinned by 15 tests, run in TypeScript, Python and Rust.
What it does
Returns the greatest common divisor (also called the highest common factor) and the least common multiple of two integers. Both are never negative: `gcd(-4, 6)` is 2 and `lcm(-4, 6)` is 12.
The conventions at zero are the ones every maths library uses: `gcd(0, n)` is `|n|`, `gcd(0, 0)` is 0, and the lcm of anything with 0 is 0.
For example
gcd_lcm(12, 18)→ gcd 6, lcm 36 12 and 18gcd_lcm(17, 5)→ gcd 1, lcm 85 coprime numbersgcd_lcm(7, 7)→ gcd 7, lcm 7 equal numbers
The function
The same function in TypeScript, Python and Rust, pinned by the same tests. Pick your language; the choice follows you around the registry.
pub fn gcd_lcm(a: i64, b: i64) -> GcdLcm
| a | int | any integer within ±(2^53 - 1) |
| b | int | any integer within ±(2^53 - 1) |
| returns | GcdLcm |
The type it declares, generated into your project
/// Both answers together; each is never negative.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct GcdLcm {
/// greatest common divisor; gcd(0, 0) is 0
pub gcd: i64,
/// least common multiple; 0 when either input is 0
pub lcm: i64,
}
Your code names it in one line, in the file that uses it
fune!(math.gcd-lcm@^1); // then call gcd_lcm(…)
Imports name this capability’s declared dependencies, which fune builds next to it in your project; each one links to its page.
use super::funejson::Value; ← the fune runtime: the JSON value the test vectors use; fune build keeps it only where a signature takes one
const MAX_SAFE: i64 = 9_007_199_254_740_991;
fn check_safe(name: &str, value: i64) {
// i64 could go further, but TypeScript cannot, and the three languages
// must give the same answer or the same error.
if !(-MAX_SAFE..=MAX_SAFE).contains(&value) {
panic!("{} is outside the safe integer range (±9007199254740991)", name);
}
}
/// Euclid's algorithm on wide integers. Never negative; `gcd_wide(0, 0)` is 0.
pub fn gcd_wide(a: i128, b: i128) -> i128 {
let mut x = a.abs();
let mut y = b.abs();
while y != 0 {
let r = x % y;
x = y;
y = r;
}
x
}
/// # Panics
/// Panics if either input is outside ±(2^53 - 1).
pub fn gcd(a: i64, b: i64) -> i64 {
check_safe("a", a);
check_safe("b", b);
gcd_wide(a as i128, b as i128) as i64
}
/// # Panics
/// Panics if either input is outside ±(2^53 - 1), or the lcm is.
pub fn lcm(a: i64, b: i64) -> i64 {
let g = gcd(a, b);
if g == 0 {
return 0;
}
// Divide before multiplying: a * b overflows long before the lcm does.
let result = (a as i128).abs() / (g as i128) * (b as i128).abs();
if result > MAX_SAFE as i128 {
panic!("the lcm of {} and {} exceeds 2^53 - 1", a, b);
}
result as i64
}
/// Greatest common divisor and least common multiple of two integers.
///
/// Both are returned together because a caller needing one nearly always
/// needs the other (common denominators, repeating schedules).
///
/// # Panics
/// Panics if either input is outside ±(2^53 - 1), or the lcm is.
pub fn gcd_lcm(a: i64, b: i64) -> GcdLcm {
GcdLcm {
gcd: gcd(a, b),
lcm: lcm(a, b),
}
}
pub fn gcd_lcm_to_value(result: &GcdLcm) -> Value {
Value::obj(vec![
("gcd", Value::Int(result.gcd)),
("lcm", Value::Int(result.lcm)),
])
}
pub fn fune_vector(args: &[Value]) -> Value {
// Refuse what the typed signature cannot hold, with the wording TypeScript
// and Python use, rather than let the conversion below quietly change it.
if let Value::Float(f) = args[0] {
if f.fract() != 0.0 {
panic!("a must be an integer, received {}", f);
}
}
if let Value::Float(f) = args[1] {
if f.fract() != 0.0 {
panic!("b must be an integer, received {}", f);
}
}
gcd_lcm_to_value(&gcd_lcm(args[0].as_i64(), args[1].as_i64()))
}Install
fune build
With that line in your source, in a Rust project (language rust in fune.project), fune build resolves it and nothing else, pins them in fune.lock, downloads only the Rust package of each, and builds the code above into your project’s .fune/build, one readable file per capability with a header linking back here. A crate’s build.rs runs it before every compile. Or pin a range in fune.project and build in one step:
fune add math.gcd-lcm
The manifest, vectors and README with only the Rust implementation. Install it without the registry with fune add ./math.gcd-lcm-1.0.0-rust.fune, or fetch it from a terminal with fune pull math.gcd-lcm@1.0.0:rust.
The whole function, every language, is one file too: math.gcd-lcm-1.0.0.fune, 10,259 bytes, sha256 c9e41636d824c974f9a85f3a786451805447acfbe1af4ee8a0b3e2d4f96448b9. It installs into a project of any language.
Customise it in your app
The seams this capability offers. Put a marker directly above a function of your own and fune build wires it into the built code; the package on the registry is not changed, the built file’s header lists it under CUSTOMISED, and fune hooks lists every hook in the project. How hooks work.
before — your function gets the arguments and returns them, changed or not, or throws to refuse the call.
// fune: before math.gcd-lcm
after — your function gets the result and the arguments, and returns the final result.
// fune: after math.gcd-lcm
replace — it requires no other capability, so there is no dependency to replace.
step — your function runs at a numbered point inside the function’s body, receives the in-scope values it names as parameters, and may return replacements. List the points with fune show math.gcd-lcm --steps.
// fune: step math.gcd-lcm after <n|label>
Tests
A version published now needs at least 8 tests for every function, and one that expects the error for each function that throws; the registry refuses it otherwise. fune verify --all runs each case in TypeScript, Python and Rust, and a project runs them again with fune verify. This page lists the cases; it does not run them. The exact JSON is vectors.json.
| Case | Arguments | Expected | |
|---|---|---|---|
| 12 and 18 | 12, 18 | → | gcd 6, lcm 36 |
| coprime numbers | 17, 5 | → | gcd 1, lcm 85 |
| equal numbers | 7, 7 | → | gcd 7, lcm 7 |
| one divides the other | 4, 20 | → | gcd 4, lcm 20 |
| one with anything | 1, 999 | → | gcd 1, lcm 999 |
| negatives give non-negative answers | -4, 6 | → | gcd 2, lcm 12 |
| both negative | -12, -18 | → | gcd 6, lcm 36 |
| zero and n: gcd is n, lcm is zero | 0, 5 | → | gcd 5, lcm 0 |
| zero and a negative | -9, 0 | → | gcd 9, lcm 0 |
| zero and zero | 0, 0 | → | gcd 0, lcm 0 |
Show the other 5 tests
| Case | Arguments | Expected | |
|---|---|---|---|
| a times b overflows even though the lcm fits: divide first | 3,000,000,021, 5,000,000,035 | → | gcd 1,000,000,007, lcm 15,000,000,105 |
| the largest safe integer with itself | 9,007,199,254,740,991, 9,007,199,254,740,991 | → | gcd 9,007,199,254,740,991, lcm 9,007,199,254,740,991 |
| an lcm beyond 2^53 - 1 is an error | 9,007,199,254,740,991, 9,007,199,254,740,990 | → | error: exceeds 2^53 - 1 |
| an input beyond 2^53 - 1 is an error | 9,007,199,254,740,992, 2 | → | error: outside the safe integer range |
| a fractional input is an error | 1.5, 3 | → | error: must be an integer |
More from the author
The lcm is computed as `|a| / gcd * |b|`, dividing first. The textbook `a * b / gcd` overflows a 64-bit integer, and loses digits in a JavaScript number, long before the answer itself is large; one of the vectors is a case where it does.
Inputs and results are limited to ±(2^53 - 1), the range where a JavaScript number is still an exact integer, so the three languages agree on every answer. An input outside it, or an lcm beyond it, is an error.
Also exported, for capabilities that build on this one: `gcd(a, b)`, `lcm(a, b)`, and `gcdWide`, a gcd over wide integers (TypeScript `bigint`, Python `int`, Rust `i128`) with no range limit, used by `math.rational` to reduce intermediate products before they are checked.
Files
| Path | Bytes |
|---|---|
| README.md | 1,073 |
| impl/python.py | 1,484 |
| impl/rust.rs | 2,429 |
| impl/typescript.ts | 1,499 |
| vectors.json | 1,587 |