ASKSAGE: Sage Q&A Forum - Latest question feedhttp://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Thu, 15 Mar 2018 20:06:28 -0500solving matrix over GF(2)http://ask.sagemath.org/question/41575/solving-matrix-over-gf2/ A = matrix(GF(2), 8, 8, [])
b = vector(GF(2), [0, 1, 1, 0, 1, 0, 1, 1])
y = vector(GF(2), [0, 0, 0, 0, 1, 0, 1, 1])
x = vector(GF(2), [1, 0, 0, 0, 0, 0, 0, 0])
If the matrix $A$ is unkown, we have $Ax+b = y$.
How can we solve the matrix $A$?
omggggggThu, 15 Mar 2018 20:06:28 -0500http://ask.sagemath.org/question/41575/solving a matrix equation modulo mhttp://ask.sagemath.org/question/10852/solving-a-matrix-equation-modulo-m/Hello,
I am quite new to sage an have troubles with the following problem:
I'm given a matrix 'A' and a vector 'b' and a positiv interger 'm' (m does not have to be prime). 'A' is a matrix with more rows than collums, so it is not quadratic. I would like to find the solution 'x' of the equation: A*x = b (mod m).
I have tried to manage it with e.g.:
A.solve_right(Integers(m),p),
but this works only if m is prime. I also was able to solve my problem if I explicitly insert the equations like this:
gp('matsolvemod([1,2;1,3],6,[1,0]~,1)')
But I need something, where I just have to specify 'A' and 'b' (and of course m). Can somebody help me?
best regardstedmosSun, 22 Dec 2013 00:12:57 -0600http://ask.sagemath.org/question/10852/