The NumberOfSolutions command computes the number of solutions of a system over the algebraic closure of the coefficient field, including multiplicities. A zero-dimensional system has a finite number of solutions.

Let G be a Groebner basis for the ideal, then the number of solutions is equal to the number of monomials not divisible by a leading monomial of G.

Note that if the second calling sequence is used, NumberOfSolutions does not verify that G actually is a Groebner basis for the monomial order tord, and the result may be incorrect if it is not.

This function is part of the PolynomialIdeals package, and can be used in the form NumberOfSolutions(..) only after executing the command with(PolynomialIdeals).  However, it can always be accessed through the long form of the command using PolynomialIdeals[NumberOfSolutions](..).

$\mathrm{with}\left(\mathrm{PolynomialIdeals}\right)\:$

$J≔⟨x^2-y\,y^3+y+1⟩$

$J≔⟨x^2-y\,y^3+y+1⟩$

$\mathrm{IsZeroDimensional}\left(J\right)$

$\mathrm{true}$

$\mathrm{NumberOfSolutions}\left(J\right)$

$6$

$M≔\left[\mathrm{seq}\left(\mathrm{seq}\left(x^i{y}^j\,j=0..2\right)\,i=0..1\right)\right]$

$M≔\left[1\,y\,y^2\,x\,xy\,x{y}^2\right]$

$G≔\mathrm{Generators}\left(J\right)$

$G≔\left\{x^2-y\,y^3+y+1\right\}$

$\mathrm{NumberOfSolutions}\left(G\,'\mathrm{plex}'\left(x\,y\right)\right)$

$6$

$K≔⟨x^2-y\,yz-1⟩$

$K≔⟨x^2-y\,yz-1⟩$

$\mathrm{IsZeroDimensional}\left(K\right)$

$\mathrm{false}$

$\mathrm{NumberOfSolutions}\left(K\right)$

$\mathrm{\infty }$

Cox, D.; Little, J.; and O'Shea, D. Using Algebraic Geometry. New York: Springer-Verlag, 1998.