Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
Periodic_1_6's profile - overview
overview
network
karma
followed questions
activity
45
karma
follow
Registered User
member since
2021-08-07 19:31:41 +0100
last seen
2025-11-20 10:53:29 +0100
todays unused votes
30
votes left
21
Questions
1k
views
1
answer
1
vote
2023-06-18 12:17:33 +0100
slelievre
Error with solve: unable to make sense of Maxima expression
TypeError
884
views
1
answer
1
vote
2021-08-17 17:29:58 +0100
Max Alekseyev
How do I use Groebner's basis in SageMath to solve a nonlinear system? [closed]
grobner-basis
nonlinear-system
312
views
1
answer
1
vote
2022-09-27 11:00:15 +0100
Periodic_1_6
Can the coefficients of these two pairs of polynomials be reduced? If yes, how do you do it with sagemath?
coefficients
polynomials
reduction
438
views
1
answer
1
vote
2021-08-08 22:23:36 +0100
tmonteil
How do I calculate the first solution, without calculating all the others?
879
views
2
answers
1
vote
2023-02-16 10:29:36 +0100
Periodic_1_6
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
no
views
no
answers
no
votes
2025-06-07 09:53:40 +0100
Periodic_1_6
Is this type of nonlinear system known to factorize N ? What is the best way (computationally speaking) to solve it ? [deleted]
nonlinear_system
2
views
no
answers
no
votes
2025-06-07 09:52:05 +0100
Periodic_1_6
Is this type of nonlinear system known to factorize N ? What is the best way (computationally speaking) to solve it ? [deleted]
nonlinear_system
7
views
no
answers
no
votes
2025-10-18 20:33:43 +0100
Periodic_1_6
Finding primes of the form 12*f+5 in polynomial time [deleted]
primes
156
views
no
answers
no
votes
2025-10-25 22:02:38 +0100
Periodic_1_6
What is the computational cost of the Cornacchia's algorithm?
Cornacchia
algorithm
16k
views
1
answer
no
votes
2025-08-31 19:13:52 +0100
Periodic_1_6
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?
modular_equation
« previous
1
...
1
2
3
...
3
next »
2
Answers
1
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
0
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?
10
Votes
10
0
24
Tags
nonlinear_system
× 9
factorization
× 7
reduction
× 5
method
× 4
TypeError
× 4
Coppersmith
× 4
cooperation
× 4
modular_equation
× 4
modular
× 3
pellsequation
× 3
grobner-basis
× 3
confirmed_issue
× 3
nonlinear-system
× 3
interface
× 2
polynomials
× 2
algorithm
× 2
sagemath
× 2
coefficients
× 2
libgmp
× 2
Cornacchia
× 2
filter
× 1
integer
× 1
primes
× 1
solutions
× 1
12
Badges
●
Supporter
×
1
How do I use Groebner's basis in SageMath to solve a nonlinear system?
●
Commentator
×
1
How to use the coppersmith method in sagemath?
●
Citizen Patrol
×
1
How can I interface a software written in C with the GMP library with sagemath?
●
Teacher
×
1
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
●
Enthusiast
×
1
●
Self-Learner
×
1
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
●
Famous Question
×
5
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?
In SageMath 9.2 :"TypeError: unable to make sense of Maxima expression" .What does it mean ?
How do I use Groebner's basis in SageMath to solve a nonlinear system?
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
How to use the coppersmith method in sagemath?
●
Popular Question
×
14
Is this type of nonlinear system known to factorize N ? What is the best way (computationally speaking) to solve it ?
To solve T^2-W*(2*h+1)^2=1 and Y^2-3*X^2=-(3*(2*h+1)^2*W+2) What procedure does sagemath use? And what is the computational cost?
Where can I post my research on factoring and hope someone will implement it in sagemath?
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?
How to reduce in sagemath a 40th degree equation to a 5th degree equation with a 6th degree equation? All three equations are mod 9
Uniqueness of an integer solution to a nonlinear polynomial system with integer coefficients
Can the coefficients of these two pairs of polynomials be reduced? If yes, how do you do it with sagemath?
How do I calculate the first solution, without calculating all the others?
How do I filter only integer solutions in sagemath?
In SageMath 9.2 :"TypeError: unable to make sense of Maxima expression" .What does it mean ?
How to use the coppersmith method in sagemath?
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
How do I use Groebner's basis in SageMath to solve a nonlinear system?
Is there a way in sagemath assisted by mathematics to find only and exclusively the first valid solution without calculating the other solutions?
●
Notable Question
×
9
Uniqueness of an integer solution to a nonlinear polynomial system with integer coefficients
Is this type of nonlinear system known to factorize N ? What is the best way (computationally speaking) to solve it ?
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?
In SageMath 9.2 :"TypeError: unable to make sense of Maxima expression" .What does it mean ?
How do I calculate the first solution, without calculating all the others?
How to use the coppersmith method in sagemath?
What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
Is there a way in sagemath assisted by mathematics to find only and exclusively the first valid solution without calculating the other solutions?
How do I use Groebner's basis in SageMath to solve a nonlinear system?
●
Scholar
×
1
How do I calculate the first solution, without calculating all the others?
●
Student
×
1
How do I calculate the first solution, without calculating all the others?
●
Editor
×
1
Is there a way in sagemath assisted by mathematics to find only and exclusively the first valid solution without calculating the other solutions?
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how