Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: GCD Computation of n Integers   Greatest Common Divisor (GCD) computation is one of the most important
operation of algorithmic number theory. In this paper we present the algorithms
for GCD computation of $n$ integers. We extend the Euclid's algorithm and
binary GCD algorithm to compute the GCD of more than two integers.

28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math