你即將離開本站

並前往https://www.sicpdistilled.com/section/1.2.5

Greatest Common Divisors - SICP Distilled

The greatest common divisor (GCD) of two integers a and b is defined to be the largest integer that divides both a and b with no remainder.

確定！ 回上一頁

查詢 「clojure gcd」的人也找了：

  1. clojure square root
    2.
  2. clojure math
    3.
  3. clojure abs
    4.
  4. clojure exponent
    5.
  5. clojure math numeric tower
    6.