Publication:
Ties in worst-case analysis of the euclidean algorithm

Simple item page
dc.contributor.authorBrian Hopkinsen_US
dc.contributor.authorAram Tangboonduangjiten_US
dc.contributor.otherMahidol Universityen_US
dc.contributor.otherSaint Peter’s Universityen_US
dc.date.accessioned2022-08-04T08:57:48Z
dc.date.available2022-08-04T08:57:48Z
dc.date.issued2021-01-01en_US
dc.description.abstractWe determine all pairs of positive integers below a given bound that require the most steps in the Euclidean algorithm. Also, we find asymptotic probabilities for a unique maximum pair or an even number of them. Our primary tools are continuant polynomials and the Zeckendorf representation using Fibonacci numbers.en_US
dc.identifier.citationMathematical Communications. Vol.26, No.1 (2021), 9-20en_US
dc.identifier.issn13310623en_US
dc.identifier.other2-s2.0-85103018881en_US
dc.identifier.urihttps://repository.li.mahidol.ac.th/handle/123456789/77389
dc.rightsMahidol Universityen_US
dc.rights.holderSCOPUSen_US
dc.source.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85103018881&origin=inwarden_US
dc.subjectMathematicsen_US
dc.titleTies in worst-case analysis of the euclidean algorithmen_US
dc.typeArticleen_US
dspace.entity.typePublication
mu.datasource.scopushttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85103018881&origin=inwarden_US

Files

Collections

Scopus 2021