|
127 | 127 | "\n", |
128 | 128 | "So what's the greatest common factor of these two expressions?\n", |
129 | 129 | "\n", |
130 | | - "It helps to break the expressions into their consitituent components. Let's deal with the coefficients first; we have 15 and 9. The highest value that divides evenly into both of these is **3** (3 x 5 = 15 and 3 x 3 = 9).\n", |
| 130 | + "It helps to break the expressions into their constituent components. Let's deal with the coefficients first; we have 15 and 9. The highest value that divides evenly into both of these is **3** (3 x 5 = 15 and 3 x 3 = 9).\n", |
131 | 131 | "\n", |
132 | 132 | "Now let's look at the ***x*** terms; we have x<sup>2</sup> and x. The highest value that divides evenly into both is these is **x** (*x* goes into *x* once and into *x*<sup>2</sup> *x* times).\n", |
133 | 133 | "\n", |
|
141 | 141 | "- The *largest* numeric factor of the numeric coefficients in the polynomial expressions (in this case 3)\n", |
142 | 142 | "- The *smallest* exponential of each variable (in this case, x and y, which technically are x<sup>1</sup> and y<sup>1</sup>.\n", |
143 | 143 | "\n", |
144 | | - "You can check your answer by dividing the original expressions by the GCF to find the coefficent expressions for the GCF (in other words, how many times the GCF divides into the original expression). The result, when multiplied by the GCF will always produce the original expression. So in this case, we need to perform the following divisions:\n", |
| 144 | + "You can check your answer by dividing the original expressions by the GCF to find the coefficient expressions for the GCF (in other words, how many times the GCF divides into the original expression). The result, when multiplied by the GCF will always produce the original expression. So in this case, we need to perform the following divisions:\n", |
145 | 145 | "\n", |
146 | 146 | "\\begin{equation}\\frac{15x^{2}y}{3xy}\\;\\;\\;\\;\\;\\;\\;\\;\\frac{9xy^{3}}{3xy}\\end{equation}\n", |
147 | 147 | "\n", |
|
184 | 184 | "\n", |
185 | 185 | "\\begin{equation}6x + 15y \\end{equation}\n", |
186 | 186 | "\n", |
187 | | - "To factor this, we need to find an expression that divides equally into both of these expressions. In this case, we can use **3** to factor the coefficents, because 3 • 2x = 6x and 3• 5y = 15y, so we can write our original expression as:\n", |
| 187 | + "To factor this, we need to find an expression that divides equally into both of these expressions. In this case, we can use **3** to factor the coefficients, because 3 • 2x = 6x and 3• 5y = 15y, so we can write our original expression as:\n", |
188 | 188 | "\n", |
189 | 189 | "\\begin{equation}6x + 15y = 3(2x) + 3(5y) \\end{equation}\n", |
190 | 190 | "\n", |
|
360 | 360 | "metadata": {}, |
361 | 361 | "source": [ |
362 | 362 | "### Perfect Squares\n", |
363 | | - "A *perfect square* is a number multiplied by itself, for example 3 multipled by 3 is 9, so 9 is a perfect square.\n", |
| 363 | + "A *perfect square* is a number multiplied by itself, for example 3 multiplied by 3 is 9, so 9 is a perfect square.\n", |
364 | 364 | "\n", |
365 | 365 | "When working with equations, the ability to factor between polynomial expressions and binomial perfect square expressions can be a useful tool. For example, consider this expression:\n", |
366 | 366 | "\n", |
|
383 | 383 | "\n", |
384 | 384 | "When you combine the two 5x terms we get back to our original expression of x<sup>2</sup> + 10x + 25.\n", |
385 | 385 | "\n", |
386 | | - "Now we have an expression multipled by itself; in other words, a perfect square. We can therefore rewrite this as:\n", |
| 386 | + "Now we have an expression multiplied by itself; in other words, a perfect square. We can therefore rewrite this as:\n", |
387 | 387 | "\n", |
388 | 388 | "\\begin{equation}(x + 5)^{2}\\end{equation}\n", |
389 | 389 | "\n", |
|
440 | 440 | "mimetype": "text/x-r-source", |
441 | 441 | "name": "R", |
442 | 442 | "pygments_lexer": "r", |
443 | | - "version": "3.4.1" |
| 443 | + "version": "3.5.0" |
444 | 444 | } |
445 | 445 | }, |
446 | 446 | "nbformat": 4, |
|
0 commit comments