Message361037
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. |
|
Date |
User |
Action |
Args |
2020-01-30 11:04:43 | mark.dickinson | set | recipients:
+ mark.dickinson, lemburg, tim.peters, rhettinger, vstinner, stutzbach, steven.daprano, serhiy.storchaka, veky, Ananthakrishnan |
2020-01-30 11:04:43 | mark.dickinson | set | messageid: <1580382283.83.0.0919574558447.issue39479@roundup.psfhosted.org> |
2020-01-30 11:04:43 | mark.dickinson | link | issue39479 messages |
2020-01-30 11:04:43 | mark.dickinson | create | |
|