Ask question

Ask question

All categories

Artyom0805 [142]

3 years ago

7

Please answer the question from the attachment.

1 answer:

grin007 [14]3 years ago

8 0

Since all of the variables are y^3, all we have to do is the addition and subtraction of the whole numbers...

2y^3 - 3y^3 + 3y^3 - 4y^3 =

-2y^3

***Notice that the -3y^3 and 3y^3 just cancel out so all you have to do is the
2-4 = -2

Piece of cake :)

You might be interested in

(PLEASE ANSWER: TIMED)The intensity, or loudness, of a sound can be measured in decibels (dB), according to the equation I(dB)=1

Mrac [35]

For this case we have the following equation:
$l(dB) = 10log( \frac{l}{lo} )$
We must replace the following value in the equation:
$l = 10^8lo$
Substituting we have:
$l(dB) = 10log( \frac{10^8lo}{lo} )$
Simplifying the given expression we have:
$l(dB) = 10log(10^8)$
Then, using logarithm properties in base 10, we can rewrite the expression:
$l(dB) = 10(8)$
Finally, making the product, the result is:
$l(dB) = 80$
Answer:
$l(dB) = 80$
option 4

3 0

3 years ago

Read 2 more answers

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

<em> Given integers </em> $a, b$ <em>, find </em> $d=gcd(a,b)$ <em />

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
If $r=0$ , stop and output $y$ ; this is the gcd of $a, b$ .
If $r\neq 0$ , replace $(x,y)$ by $(y,r)$ . Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

3 years ago

Mr. Davis divided his money in the ratio 4:6 between James and Brett. James got the smaller amount of $540. How much did Brett r

sattari [20]

Answer:

$810

LMK if you need an explanation.

3 0

3 years ago

Sqareroot 12 - (sqr. 3) = ?

Brrunno [24]

1.73 is the answer >:-)............................

7 0

3 years ago

Help!! I’m not smart.

Vadim26 [7]

Answer:

C. Reasons for changes in trends can be identified.

Step-by-step explanation:

The others would all be disadvantages.

7 0

3 years ago

Read 2 more answers