Factor each out:
11: 1*11
39: 3*13
35: 5*7
8: 2*2*2
since you can see no common factor just multiply them all to get 120120
Answer:
Step-by-step explanation:
The first step in solving the equation is to cube both sides:
(∛x)³ = (-4)³ . . . . . = (-4)(-4)(-4) = 16(-4) = -64
x = -64 . . . . . simplified
__
We're not sure what "checking" is supposed to involve here. Usually, one would check the answer by seeing if a true statement is made when the answer is put into the original equation.
∛(-64) = -4 . . . true
Many calculators will not compute √(-64) because they compute roots using logarithms. The log of a negative number is not defined.
So, the way one would check this is to cube both sides, which is how we got the answer in the first place. We expect the same result from doing the same operation again, so it isn't really a check.
Answer:
https://ohsrehak.weebly.com/uploads/5/4/6/9/54699399/5-1_bisectors_of_triangles_solutions.pdf paste the click
Step-by-step explanation:
Answer:
Solve the equation for y by finding a, b, and c
of the quadratic then applying the quadratic formula.
Exact Form:
y = 3,−9/2
Decimal Form:
y = 3,−4.5
Mixed Number Form:
y = 3,− 4 1/2
Step-by-step explanation:
branliest pls
Question:
Consider the sequence of numbers: 
Which statement is a description of the sequence?
(A) The sequence is recursive, where each term is 1/4 greater than its preceding term.
(B) The sequence is recursive and can be represented by the function
f(n + 1) = f(n) + 3/8 .
(C) The sequence is arithmetic, where each pair of terms has a constant difference of 3/4 .
(D) The sequence is arithmetic and can be represented by the function
f(n + 1) = f(n)3/8.
Answer:
Option B:
The sequence is recursive and can be represented by the function
Explanation:
A sequence of numbers are
Let us first change mixed fraction into improper fraction.
To find the pattern of the sequence.
To find the common difference between the sequence of numbers.
Therefore, the common difference of the sequence is 3.
That means each term is obtained by adding 
to the previous term.
Hence, the sequence is recursive and can be represented by the function
