For my project, I need to solve for a matrix X given matrices Y and K.
(X*Y=K) The elements of each matrix must be integers modulo a random
256-bit prime. My first attempt at solving this problem used SymPy's
mod_inv(n) function. The problem with this is that I'm running out of
memory with matr
I have implemented a custom matrix printer with "_print_MatrixBase(self,
expr)." I am running "jupyter notebook" with the output of
"_print_MatrixBase(self, expr)" being given by -
def _print_MatrixBase(self, expr):
rows = expr.rows
cols = expr.cols
out_str = ' \\l
