Look for some patterns in the following triangle of numbers. The first row is 1 = 1. 1=1
3+5=8
7+ 9 + 11 = 27
13 + 15 + 17 + 19 = 64
What is the 10th row of this triangle, and what is its sum? Enter left-hand side as a sum using he + key
1Oth row =

(x3 + 6x2 + 2x - 6) • (x - 1)

step-by-step explanation:

polynomial long division :

3.2     polynomial long division

dividing :   x4+5x3-4x2-8x+6

                              ("dividend")

by         :     x-1     ("divisor")

dividend     x4   +   5x3   -   4x2   -   8x   +   6

- divisor   * x3     x4   -   x3            

remainder         6x3   -   4x2   -   8x   +   6

- divisor   * 6x2         6x3   -   6x2        

remainder             2x2   -   8x   +   6

- divisor   * 2x1             2x2   -   2x    

remainder               -   6x   +   6

- divisor   * -6x0               -   6x   +   6

remainder                     0

quotient :   x3+6x2+2x-6   remainder:   0

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

step-by-step explanation:

assume that you have 3 different side lengths.   apply the pythagorean theorem here:   square each of the two shortest sides; call them a and b, so that their squares are a² and b².   also square the longest side, calling the result c².

now, if a² + b² = c² is true, the triangle is a right triangle; otherwise it is not a right triangle.