Use the binomial expansion theorem to find each term. The binomial theorem states <math><mstyle displaystyle="true"><msup><mrow><mo>(</mo><mi>a</mi><mo>+</mo><mi>b</mi><mo>)</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>k</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>n</mi></mrow></munderover></mstyle><mo>⁡</mo><mi>n</mi><mi>C</mi><mi>k</mi><mo>⋅</mo><mrow><mo>(</mo><msup><mrow><mi>a</mi></mrow><mrow><mi>n</mi><mo>-</mo><mi>k</mi></mrow></msup><msup><mrow><mi>b</mi></mrow><mrow><mi>k</mi></mrow></msup><mo>)</mo></mrow></mstyle></math> .

Expand the summation.

Simplify the exponents for each term of the expansion.

Multiply <math><mstyle displaystyle="true"><msup><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Apply the product rule to <math><mstyle displaystyle="true"><mo>-</mo><mi>y</mi></mstyle></math> .

Rewrite using the commutative property of multiplication.

Anything raised to <math><mstyle displaystyle="true"><mn>0</mn></mstyle></math> is <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Multiply <math><mstyle displaystyle="true"><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Anything raised to <math><mstyle displaystyle="true"><mn>0</mn></mstyle></math> is <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Multiply <math><mstyle displaystyle="true"><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Simplify.

Simplify.

Rewrite using the commutative property of multiplication.

Multiply <math><mstyle displaystyle="true"><mn>2</mn></mstyle></math> by <math><mstyle displaystyle="true"><mo>-</mo><mn>1</mn></mstyle></math> .

Multiply <math><mstyle displaystyle="true"><msup><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mrow><mn>0</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Anything raised to <math><mstyle displaystyle="true"><mn>0</mn></mstyle></math> is <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Multiply <math><mstyle displaystyle="true"><msup><mrow><mo>(</mo><mo>-</mo><mi>y</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Apply the product rule to <math><mstyle displaystyle="true"><mo>-</mo><mi>y</mi></mstyle></math> .

Raise <math><mstyle displaystyle="true"><mo>-</mo><mn>1</mn></mstyle></math> to the power of <math><mstyle displaystyle="true"><mn>2</mn></mstyle></math> .

Multiply <math><mstyle displaystyle="true"><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup></mstyle></math> by <math><mstyle displaystyle="true"><mn>1</mn></mstyle></math> .

Do you know how to Expand using the Binomial Theorem (x-y)^2? If not, you can write to our math experts in our application. The best solution for your task you can find above on this page.

Name | one billion twenty-one million nine hundred six thousand nine hundred sixty |
---|

- 1021906960 has 64 divisors, whose sum is
**5198656788** - The reverse of 1021906960 is
**0696091201** - Previous prime number is
**205**

- Is Prime? no
- Number parity even
- Number length 10
- Sum of Digits 34
- Digital Root 7

Name | six hundred thirty million three hundred nineteen thousand six hundred eighty-six |
---|

- 630319686 has 32 divisors, whose sum is
**1272727680** - The reverse of 630319686 is
**686913036** - Previous prime number is
**673**

- Is Prime? no
- Number parity even
- Number length 9
- Sum of Digits 42
- Digital Root 6

Name | one billion four hundred eighty-five million six hundred eighty-one thousand two hundred sixty-six |
---|

- 1485681266 has 16 divisors, whose sum is
**2285057304** - The reverse of 1485681266 is
**6621865841** - Previous prime number is
**157**

- Is Prime? no
- Number parity even
- Number length 10
- Sum of Digits 47
- Digital Root 2