<img src="https://tex.z-dn.net/?f=%5Cfrac%7Bb%5E%7B-2%7D%20%7D%7Bb%5E%7B4%7D%20%7D" id="TexFormula1" title="\frac{b^{-2} }{b^{4}

All categories

cupoosta [38]

3 years ago

}" alt="\frac{b^{-2} }{b^{4} }" align="absmiddle" class="latex-formula"> in scientific notation

Mathematics

1 answer:

MAXImum [283]3 years ago

3 0

Answer: $\frac{1}{b^6}$ or $b^{-6}$

Step-by-step explanation:

$\frac{b^-2+2}{b^4+2}$ Add the exponent two to both sides. After adding -2 and 2 you get 0 and any number raised to the zero power is one. And 4 plus two is 6

$\frac{b^0}{b^6}$ = $\frac{1}{b^6}$

You might be interested in

Terrence plants a garden that has 8 rows of flowers, with 28 flower each row. How many flowers did Terrence plant?

My name is Ann [436]

28 * 8 = 224

Terrence planted 224 plants.

5 0

3 years ago

Read 2 more answers

El costo de un teléfono celular con un descuento del 30% sobre el precio de lista, está dado por p(x)= x-0.30x. El impuesto a pa

sergejj [24]

B is the answer to your question

5 0

3 years ago

The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, … is formed by summing two consecutive numbers to get the next number.

adelina 88 [10]

By counting the combinations, we will see that there are 10 combinations such that the sum gives a Fibonacci number.

<h3>How to count the combinations?</h3>

We have two number cubes with 6 outcomes each, such that we have a total of 36 combined outcomes.

For each dice, the outcomes are:

{1, 2, 3, 5, 8, 13}

Now, let's count the combinations that also give a Fibonacci number (these are given by adding two consecutive numbers in the sequence).

I will list each possible red outcome, then the blue outcomes that would give a Fibonacci term, and then we can count the number of combinations.