![9 The resultant and a modular gcd algorithm in Z[x]](http://s1.studyres.com/store/data/017337470_1-8c6dfa8fbd5c9da3a383209d818c2d7f-300x300.png)
Feb 15
... (c) R, with the operations of addition and division. (d) The set R∗ of non-zero real numbers, with the operations of multiplication, and the operation a ◦ b = 1. Note: We are trying to use ordinary multiplication as the ‘addition’ in this set! (e) The set of polynomials in Q [x], where the constant ...
... (c) R, with the operations of addition and division. (d) The set R∗ of non-zero real numbers, with the operations of multiplication, and the operation a ◦ b = 1. Note: We are trying to use ordinary multiplication as the ‘addition’ in this set! (e) The set of polynomials in Q [x], where the constant ...
Introduction to Tensor Calculus
... to construct objects that, contrary to normal vectors, transform the same as the basis vector columns. In the simple case in which, for example, the basis vector ~e1 ′ transforms into 12 ×~e1 , the coordinate of this object must then also 21 times as large. This is precisely what happens to the coor ...
... to construct objects that, contrary to normal vectors, transform the same as the basis vector columns. In the simple case in which, for example, the basis vector ~e1 ′ transforms into 12 ×~e1 , the coordinate of this object must then also 21 times as large. This is precisely what happens to the coor ...
