E-mail:
Keywords: greatest common divisor, k-ary gcd algorithms, continuants
UDC: 511

Subject:

greatest common divisor, k-ary gcd algorithms, continuants

Main publications:

1. D.A. Dolgov., “GCD calculation in the search task of pseudoprime and strong pseudoprime numbers”, Lobachevskii Journal of Mathematics., 37:6 (2016), 734-739

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 

Organisations:

• Institute of Computer Mathematics and Information Technologies, Kazan (Volga Region) Federal University
• Kazan (Volga Region) Federal University