38557
Calculating a greatest common divisor is an essential step in several integer factorization algorithms , such as Pollard 's rho algorithm , Shor 's algorithm , Dixon 's factorization method and the Lenstra elliptic curve factorization .
 person: Pollard; person: Shor; person: Dixon; person: Lenstra
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities: Pollard, Shor, Dixon, Lenstra 
Answer:
 person: Pollard; person: Shor; person: Dixon; person: Lenstra