Putting an equation in quadratic form

  • Thread starter Thread starter miahmad
  • Start date Start date
  • Tags Tags
    Form Quadratic
miahmad
Messages
5
Reaction score
0
Could someone please explain how to go about putting an equation into quadratic form.
e.g:
Q(x,y,z)=7x^2-2y^2-40z^2-14xz+20yz.

I know it equals 7(x-z)^2 -2(y-5z)^2 +3z^2. dnt know how to get there though.
 
Physics news on Phys.org
Dnt wrry figured it out.
 
What you want to do is first make a square which gets all the x terms right, then a square which gets all the y terms right, but without touching the x. Then in the end, you can use the z2 term to balance the z's.

So, for example, with an x you have 7x2 and -14xz.
If you write c (x - a)2, you will get terms with c x2 and 2 x a c, and stuff with a2, which you can cancel by -a2 terms, if you need. So you can reproduce these two terms by taking c = 7, a = -z.

Then you do the same with the y, choosing numbers c and a such that you exactly get the right y2 and yz terms.

Then, you multiply out everything you have so far. If you did it right, all the terms will match, except possibly those with only z2. Since z2 is itself a square, you can easily fix this by adding the appropriate amount of z2 at the end, and you're done.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top