A new WG21 paper is available. A copy is linked below, and the paper will also appear in the next normal WG21 mailing. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.

Document number: N3913

Date: 2014-02-25

Greatest Common Divisor and Least Common Multiple, v2

by Walter Brown

Excerpt:

This paper proposes two frequently-used classical numeric algorithms, gcd and lcm, for header <numeric>. The former calculates the greatest common divisor of two integer values, while the latter calculates their least common multiple. Both functions are already typically provided in behind-the-scenes support of the standard library’s <ratio> and <chrono> headers.

...

4 Acknowledgments

Many thanks to the readers of early drafts of this paper for their thoughtful comments. Special
thanks to Cassio Neri for his extra-careful proofreading and helpful suggestions.