Greatest common divisor (gcd)

Given a set of integers $a_1$, ..., $a_n$, returns the largest number that divides $a_1$, ..., $a_n$ simultaneously.

Given a list of integers $\{a_1,...,a_n\}$, returns the largest number that divides $a_1$, ..., $a_n$ simultaneously.

Given a vector of integers $[a_1,...,a_n]$, returns the largest number that divides $a_1$, ..., $a_n$ simultaneously.

Given two fractions $\frac{a}{b}$ and $\frac{c}{d}$, returns its greatest common divisor defined as $gcd\left(\frac{a}{b},\frac{c}{d}\right)=\frac{gcd(a,c)}{lcm(b,d)}$

Least common multiple (lcm), Prime, Factor