I have noticed that Maple's command isolve doesn't always seem to work for me. An example would be solving

x^2 + y^2 +z^2 =3 over the integers. Maple does not return any solutions.

I have found that isolve work for two variables, so I have just been iterating the third variable and applying isolve. However what if I want to solve  something with negative coefficients like : x^2 +y^2 +2*z^2 +x*y -y*z, then I have to be careful about which variable I iterate and the bounds are not always obvious.

Is there an easy fix to solve a homogeneous degree 2 polynomial in three variables over the integers ? Thanks!

I have a monomial in 8 letters j_0, j_1, j_3, j_4, j_6, j_10, j_11, j_15 with corresponding exponents b_0, b_1, b_3, b_4, b_6, b_10, b_11, b_15. I would like Maple to calculate 0*b_0 + 1*b_1 +3*b_3 +...15*b_15. I know indets returns a list of the variables, but I am not sure how to pull off the indices and exponents? Thank you very much for the help!

Hello,

I am in need of a command that given a positive integer n (length of tuple), and a bound b, the output is a list of all n tuples with elements ranging from 0 to b. The command is analogous to "Tuples" in Mathematica:

http://reference.wolfram.com/mathematica/ref/Tuples.html

Thank you for the help!

Let $F, f_1, \ldots f_5$ be polynomials in $\mathbb{Z}_p[r,s,t,u,v]$, the ring of polynomials in 5 variables over the integers modulo an odd prime $p$. By forming the ideal $J:=<>$ I can test whether $F$ is a member of $J$. Indeed $F$ is a member of $J$ and so I know there exists polynomials $a_1,\dots,a_r \in \mathbb{Z}_p[r,s,t,u,v]$ such that $$F = a_1f_1+\dots+ a_rf_r $$ My question is how to explicitly compute $a_1,\dots,a_r$ in Maple, or Sage if you prefer. Thank...