On a new algorithm for computing GCD of integer numbers
<p>In the paper we give an introduction to a new algorithm counting the greatest common divisor (GCD) of natural integers called the approximating GCD algorithm introduced by S.Ishmukhametov in 2016. We compare it with the classical Euclidean GCD algorithm and the kary GCD algorithm in spirit...
I tiakina i:
Ngā kaituhi matua: | ST Ishmukhametov (Author), BG Mubarakov (Author), RG Rubtsova (Author), Al Khalidi Arkan Mohammed (Author) |
---|---|
Hōputu: | Pukapuka |
I whakaputaina: |
Trends in Computer Science and Information Technology - Peertechz Publications,
2020-07-06.
|
Ngā marau: | |
Urunga tuihono: | Connect to this object online. |
Ngā Tūtohu: |
Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
Ngā tūemi rite
-
A simple algorithm for GCD of polynomials
mā: Pasquale Nardone, me ētahi atu.
I whakaputaina: (2022) -
New Challenges Arising in Engineering Problems with Fractional and Integer Order
I whakaputaina: (2021) -
Integers: Annual Volume 2013
I whakaputaina: (2014) -
Chapter Restricted integer partition functions
mā: Alon, Noga
I whakaputaina: (2014) -
Scaffolding for Slow Learner Children on Integer Operations
mā: Christina Yulia Susilo, me ētahi atu.
I whakaputaina: (2022)