Hi Thomas,<div><br></div><div>Thank you for the intention, but as far as i know, GCD and LCM makes no sense in the rational field. Any rational number is divisible by all rationals. For instance, given two rationals b, r in Q, r != 0, you can write:</div>
<div><br></div><div>b = (b * r^-1) * r</div><div><br></div><div>and then b is divisible by r.</div><div><br></div><div>Regards,</div><div>Júlio.</div><div><br><div class="gmail_quote">2011/7/21 Thomas Taylor <span dir="ltr">&lt;<a href="mailto:thomas.taylor@univie.ac.at">thomas.taylor@univie.ac.at</a>&gt;</span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Dear boost users and maintainers,<br>
<br>
As I needed these functions myself I have added a gcd and an lcm for the<br>
rational type.<br>
Feel free to do with the code whatever you want, if suitable add it to<br>
rational.hpp. Presumably this could be reworked as partial specialisation of<br>
boost::math::gcd and boost::math::lcm respectively (if there is a trait like<br>
is_rational).<br>
<br>
HTH,<br>
<font color="#888888">Thomas<br>
<br>
<br>
</font><br>_______________________________________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br></blockquote></div><br></div>