BulDML at Institute of Mathematics and Informatics >
Proceedings >
ADIS 2018 >

Please use this identifier to cite or link to this item:

Title: New Realization of the Euclidean Algorithm
Authors: Iliev, Anton
Kyurkchiev, Nikolay
Keywords: Euclidean algorithm
Knuth’s realization
Schmidt realization
Stepanov realization
shorter CPU Time
Issue Date: 1-Jun-2018
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Association for the Development of the Information Society
Citation: Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2018, 180p-185p
Series/Report no.: ADIS;2018
Abstract: In this paper we will expose results connected to the practical realization of Euclidean algorithm in contemporary programming environment (Visual C# 2017) and CAS Wolfram Mathematica. Results of numerical experiments show that algorithm conducting take shorter CPU Time which is one of basic tasks for everyone who is involved in calculations, professional programmer and specialist in applied mathematics. The task of searching greatest common divisor is basic at least for 3 branches of nowadays science: Algebra, Number theory and Discrete Mathematics. Similar tasks are of interest to specialists in parallel computer architectures and realized on them algorithms.
Description: Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2018
ISSN: 1314-0752
Appears in Collections:ADIS 2018

Files in This Item:

File Description SizeFormat
ERIS2018-book-p20.pdf283.9 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License