Comment #3 on issue 3673 by eumod...@gmail.com: Matrices of matrices
http://code.google.com/p/sympy/issues/detail?id=3673
Hi,
if I print the null matrix of the one I mentioned before, namely
A_s = [[2,0,4,4,6],
[0,0,1,4,2],
[4,0,8,8,12],
[6,4,2,12,0]]
A = Matrix(A_s)
Comment #7 on issue 3038 by smi...@gmail.com: sign change in evalf of
complex value as precision is increased
http://code.google.com/p/sympy/issues/detail?id=3038
Just a note: it's interesting to note that `v` of comment 2 can be shown to
have a zero for the imaginary part with:
Updates:
Status: Fixed
Comment #4 on issue 1640 by smi...@gmail.com: tsolve problem
http://code.google.com/p/sympy/issues/detail?id=1640
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
issue notifications to this
Updates:
Status: Fixed
Comment #4 on issue 3377 by smi...@gmail.com: Remove deprecated
as_coeff_terms and as_coeff_factors
http://code.google.com/p/sympy/issues/detail?id=3377
(No comment was entered for this change.)
--
You received this message because this project is configured
Additionally, I think it could be quite useful to implement a module for
working with representations and character tables, especially for some of
the classical finite groups. One could probably also spend a lot of time
just implementing it for permutation groups.
--
You received this
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
