template <> Arbint Tabs(const Arbint & a);
template <> Gmpint Tabs(const Gmpint & a);
+
/* Recursive version of GCD
template <class T>
T gcd(const T & a, const T & b)
{
Simplify();
}
+
+
Rational(const T & _P, const T & _Q) : P(_P), Q(_Q)
{
Rational & operator-=(const Rational & r) {this->operator=(*this-r); return *this;}
Rational & operator*=(const Rational & r) {this->operator=(*this*r); return *this;}
Rational & operator/=(const Rational & r) {this->operator=(*this/r); return *this;}
+ Rational Sqrt() const
+ {
+ return Rational(sqrt(ToDouble()));
+ }
+
+ int64_t ToInt64() const
+ {
+ return (int64_t)ToDouble();
+ }
double ToDouble() const
{
T num = P, denom = Q;
- while (Tabs(num) > T(DBL_MAX))
+ while (Tabs(num) > T(1e10))
{
num /= T(16);
denom /= T(16);
};
-
-
+template <class P>
+Rational<P> Abs(const Rational<P> & a)
+{
+ return Rational<P>(Tabs(a.P), a.Q);
+}
}