# On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.

Gaceta Matemática (1967)

- Volume: 19, Issue: 5-6, page 127-132
- ISSN: 0016-3805

## Access Full Article

top## How to cite

topLaborde, 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 19.5-6 (1967): 127-132. <http://eudml.org/doc/43388>.

@article{Laborde1967,

author = {Laborde, P.},

journal = {Gaceta Matemática},

keywords = {greatest common divisor; set of integers},

language = {eng},

number = {5-6},

pages = {127-132},

title = {On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.},

url = {http://eudml.org/doc/43388},

volume = {19},

year = {1967},

}

TY - JOUR

AU - Laborde, P.

TI - On an algorithm which produces the g.c.d. of a set of n (n>2) integers in a simultaneous manner.

JO - Gaceta Matemática

PY - 1967

VL - 19

IS - 5-6

SP - 127

EP - 132

LA - eng

KW - greatest common divisor; set of integers

UR - http://eudml.org/doc/43388

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.