Hi,
I think it would be better if we represent the rational numbers as a
product of primes raised to some integer power.
We can compute and store all the primes we will need to work with a
practically large number, say anyone will not need to work with numbers
larger than 10**20.
Then well will need store only primes less than 10**10, because if some
number is not divisible by any number less than equal to sqrt(n) then it is
prime.
And if we happen to need more primes than we have stored then we can
compute them in the run time.
Representing the rational this way will make multiplication and division of
primes a lot faster.
--
Harsh Gupta
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sympy?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
