Algorithm 386: Greatest common divisor of n integers and multipliers

Gordon H. Bradley. Algorithm 386: Greatest common divisor of n integers and multipliers. Communications of the ACM, 13(7):447-448, 1970. [doi]

@article{Bradley70a,
  title = {Algorithm 386: Greatest common divisor of n integers and multipliers},
  author = {Gordon H. Bradley},
  year = {1970},
  doi = {10.1145/362686.362697},
  url = {http://doi.acm.org/10.1145/362686.362697},
  researchr = {https://researchr.org/publication/Bradley70a},
  cites = {0},
  citedby = {0},
  journal = {Communications of the ACM},
  volume = {13},
  number = {7},
  pages = {447-448},
}