توابع محاسبه ب.م.م (GCD) و ک.م.م (LCM) دو عدد به زبان های مختلف :
F#:
let GCD(a : int, b : int) : int =let mutable rv : int = 0let mutable ia : int = alet mutable ib : int = bwhile rv = 0 doif ia = 0 thenrv <- ibelseib <- ib % iaif ib = 0 thenrv <- iaelseia <- ia % ibrvlet LCM(a : int, b : int) : int =let mutable tmp : int = GCD(a, b)let mutable rv : int = 0if tmp <> 0 thenrv <- a / tmp * brv
int GCD(int a, int b){for (;;){if (a == 0) return b;b %= a;if (b == 0) return a;a %= b;}}int LCM(int a, int b){int tmp = GCD(a, b);return tmp ? (a / tmp*b) : 0;}
Function GCD(ByVal a As Integer, ByVal b As Integer)While TrueIf a = 0 Then Return bb = b Mod aIf b = 0 Then Return aa = a Mod bEnd WhileEnd FunctionFunction LCM(ByVal a As Integer, ByVal b As Integer)Dim tmp As Integer = GCD(a, b)If tmp <> 0 ThenReturn a / tmp * bElseReturn 0End IfEnd Function