➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author mark.dickinson
Recipients Ananthakrishnan, lemburg, mark.dickinson, rhettinger, serhiy.storchaka, steven.daprano, stutzbach, tim.peters, veky, vstinner
Date 2020-01-30.11:04:43
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1580382283.83.0.0919574558447.issue39479@roundup.psfhosted.org>
In-reply-to
Content 
I'd guess a // gcd(a, b) * b would be faster, on the basis that division is slower than multiplication. But I doubt it's worth worrying about for this implementation, given that the gcd call is likely to be the bottleneck as a and b get large.
History
Date User Action Args
2020-01-30 11:04:43mark.dickinsonsetrecipients: + mark.dickinson, lemburg, tim.peters, rhettinger, vstinner, stutzbach, steven.daprano, serhiy.storchaka, veky, Ananthakrishnan
2020-01-30 11:04:43mark.dickinsonsetmessageid: <1580382283.83.0.0919574558447.issue39479@roundup.psfhosted.org>
2020-01-30 11:04:43mark.dickinsonlinkissue39479 messages
2020-01-30 11:04:43mark.dickinsoncreate