Name

---

      GCD_MOD

Purpose

---

      Find the greatest common divisor of two integers by modulo.

Category

---

Calling Sequence

---

      c = gcd_mod(a,b)

Inputs

---

      a, b = Two integers. in

Keyword Parameters

---

Outputs

---

      c = The greatest common divisor of both a and b. out

Common Blocks

---

Notes

---

      Notes: Uses the Euclidean algorithm as given in Wikipedia.

Modification History

---

      R. Sterner, 2011 Sep 07
  Copyright (C) 2011, Johns Hopkins University/Applied Physics Laboratory
  This software may be used, copied, or redistributed as long as it is not
  sold and this copyright notice is reproduced on each copy made. This
  routine is provided as is without any express or implied warranties
  whatsoever. Other limitations apply as described in the file disclaimer.txt.