On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.
Laborde, P.
Gaceta Matemática, Tome 19 (1967), p. 127-132 / Harvested from Biblioteca Digital de Matemáticas
Access to full text
Publié le : 1967-01-01
DMLE-ID : 5919 
@article{urn:eudml:doc:43388,
     title = {On an algorithm which produces the g.c.d. of a set of n (n\>2) integers in a simultaneous manner.},
     journal = {Gaceta Matem\'atica},
     volume = {19},
     year = {1967},
     pages = {127-132},
     zbl = {0156.04706},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:43388}
}

Laborde, P. On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.. Gaceta Matemática, Tome 19 (1967) pp. 127-132. http://gdmltest.u-ga.fr/item/urn:eudml:doc:43388/