Use the unique factorization of integers theorem to prove the following statement. If n is any positive integer that is not a pe
1 answer:
You might be interested in
The standard form of a quadratic equation is 
, while the vertex form is:
, where (h, k) is the vertex of the parabola.
What we want is to write
as
First, we note that all the three terms have a factor of 3, so we factorize it and write:
.
Second, we notice that
are the terms produced by 
, without the 9. So we can write:
, and substituting in we have:
![\displaystyle{ y=3(x^2-6x-2)=3[(x-3)^2-9-2]=3[(x-3)^2-11]](https://tex.z-dn.net/?f=%5Cdisplaystyle%7B%20y%3D3%28x%5E2-6x-2%29%3D3%5B%28x-3%29%5E2-9-2%5D%3D3%5B%28x-3%29%5E2-11%5D)
.
Finally, distributing 3 over the two terms in the brackets we have:
![y=3[x-3]^2-33](https://tex.z-dn.net/?f=y%3D3%5Bx-3%5D%5E2-33)
.
Answer:
What we want is to write
First, we note that all the three terms have a factor of 3, so we factorize it and write:
Second, we notice that
Finally, distributing 3 over the two terms in the brackets we have:
Answer:
