online advertising
Loading [MathJax]/jax/output/HTML-CSS/jax.js

Sunday, February 7, 2016

UTM Ideals Varieties and Algorithm - Chapter 1 Section 5 Exercise 16

Problem:


Solution:

The previous exercises basically outlined the whole algorithm.

First, find the GCD, g, of f1,,fs. We know that V(f1,,fs)=V(g).

Next, compute gred=gGCD(g,g)

Now we know I(V(f1,,fs))=I(V(g))=gred

No comments:

Post a Comment