The following function attempts to calculate the n th triangular number ( Tn ). The n th triangular number is defined by the formula: Tn=n+(n−1)+(n−2)+...+3+2+1 In other words, triangular numbers are just like factorial numbers, but with addition instead of multiplication. Below we've attempted to write a recursive formula that will calculate the n th triangular number. 1| def tri(n): 2| return n + tri(n - 1) What will be the current result of using this function?

- 2 + 10x³ - 21x² + 19x - 4

step-by-step explanation:

each term in the second factor is multiplied by each term in the first factor

x²(- 2x² + 4x - 1) - 3x(- 2x² + 4x - 1) + 4(- 2x² + 4x - 1) ← distribute

= - 2 + 4x³ - x² + 6x³ - 12x² + 3x -8x² + 16x - 4

collect like terms

= - 2 + 10x³ - 21x² + 19x - 4 ← in standard form

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

step-by-step explanation:

because 1/3 is a fraction. we can tell because there is a divisor symbol between the 1 and the 3. if we were to add 2 fractions together, we would add the numerators, which is the number on top, but not the denominators, which is the number on the bottom

1/3+1/3=2/3

hope this !