Ratio Calculator and Simplifier

            from math import gcd

def first_ratio_term(a: int, b: int) -> int:
    return a // gcd(a, b)

assert first_ratio_term(18, 24) == 3
          

            #include <assert.h>
#include <stdint.h>
int64_t gcd64(int64_t a,int64_t b){if(a<0)a=-a;if(b<0)b=-b;while(b){int64_t r=a%b;a=b;b=r;}return a;}
int64_t first_ratio_term(int64_t a,int64_t b){return a/gcd64(a,b);}
int main(void){assert(first_ratio_term(18,24)==3);}
          

            #include <cassert>
#include <cstdint>
#include <numeric>
std::int64_t first_ratio_term(std::int64_t a,std::int64_t b){return a/std::gcd(a,b);}
int main(){assert(first_ratio_term(18,24)==3);}
          

x86-64 NASM · System V ABI · Linux · integer arguments in rdi, rsi and rdx

            ; int64_t first_ratio_term(int64_t a, int64_t b)
global first_ratio_term
section .text
gcd64:
    mov rax, rdi
    test rax, rax
    jns .a_ok
    neg rax
.a_ok:
    mov rcx, rsi
    test rcx, rcx
    jns .b_ok
    neg rcx
.b_ok:
    test rcx, rcx
    jz .done
.loop:
    xor rdx, rdx
    div rcx
    mov rax, rcx
    mov rcx, rdx
    test rcx, rcx
    jnz .loop
.done:
    ret

first_ratio_term:
    push rbx
    mov rbx, rdi
    call gcd64
    mov rcx, rax
    mov rax, rbx
    cqo
    idiv rcx
    pop rbx
    ret
          

            function result = first_ratio_term(a, b)
    divisor = gcd(abs(round(a)), abs(round(b)));
    result = round(a) / divisor;
end
          

            ClearAll[mwCalculate];
mwCalculate[a_Integer, b_Integer] := First[{a, b}/Apply[GCD, {a, b}]];