Suppose we want to choose 6 letters, without replacement, from 15 distinct letters. (A) how many ways can this be done, if the o
1 answer:
You might be interested in
Hello!
**Process pictured below**
When dividing, find how many times the first time in the divisor (2x + 3) fits into the first time of the dividend (2x³ + 5x² - 3x - 5). In this step, it fits x² times.
Multiply x² by the terms in the divisor and subtract from the dividend. Bring down the next term in the dividend to continue the process.
Repeat this step until you reach the last number. In this case, there was a remainder of 4. In order to write the remainder, you must express it over the divisor which makes it 4 / 2x + 3.
