RSS

Sort by » relevance date activity ▲ answers votes

217 questions

908

views

answer

vote

2024-04-16 22:47:46 +0100 Max Alekseyev

Thue-Mahler equation

number-theory
diophantine

283

views

answer

votes

2024-04-30 11:58:41 +0100 snowch

Issue porting solve utility from sympy to sagemath

views

answers

vote

2024-07-08 13:56:30 +0100 Emmanuel Charpentier

Finding integer solutions to systems of polynomial equations

polynomials
solve
ring
variable

553

views

answer

votes

2024-09-11 20:37:29 +0100 Max Alekseyev

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

matrices
linear-algebra

586

views

answer

vote

2024-10-02 19:48:47 +0100 Afandi_MohAlsh

Change of Coords. in Symbolic Comp.

cartesian
spherical
coordinates
3_variables

486

views

answer

votes

2024-12-27 15:04:54 +0100 dan_fulea

Solving a system by resultant computations

resultant

16k

views

answer

votes

2025-08-31 19:13:52 +0100 Periodic_1_6

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

modular_equation

217 questions

Thue-Mahler equation

Issue porting solve utility from sympy to sagemath

Finding integer solutions to systems of polynomial equations

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

Change of Coords. in Symbolic Comp.

Solving a system by resultant computations

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

Contributors

Tags

217 questions

Thue-Mahler equation

Issue porting solve utility from sympy to sagemath

Finding integer solutions to systems of polynomial equations

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

Change of Coords. in Symbolic Comp.

Solving a system by resultant computations

How does sagemath solve X*a*b+Y*a+Y*b+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

Contributors

Tags

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?