1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
nexus9112 [7]
3 years ago
12

Simplify each exponential expression using the properties of exponents and match it to the correct answer

Mathematics
2 answers:
jekas [21]3 years ago
7 0

3^-3*2^-3*6^3 = 1

last one=2

2nd one =1/2

mr_godi [17]3 years ago
6 0

3^-3 * 2^-3 *6^3 / (4^0)^2

= 6^-3 * 6^3 / (1)^2

= 1 / 1

= 1

---------------------------------------

2^4 * 3^5 / (2*3)^5

= 2^4 * 3^5 / 2^5 *3^5

= 1/ 2^1

= 1/2

---------------------------

(3 * 2)^4 * 3^-3 / 2^3 * 3

=3^4 * 2^4 * 3^-3 / 2^3 * 3

= 3^1 * 2^4 / 2^3 * 3

= 2^1

= 2

-----------------------

3^2 * 4^3 * 2^-1 / (3 * 4)^2

= 3^2 * 4^3 / 3^2 * 4^2 * 2^1

= 4^1 / 2^1

= 4/2

= 2

You might be interested in
Let X1, . . . ,Xn ∈ R be independent random variables with a common CDF F0. Let Fn be their ECDF and let F be any CDF. If F = Fn
Georgia [21]

Answer:

See the proof below.

Step-by-step explanation:

For this case we need to proof that: Let X_1, X_2, ...X_n \in R be independent random variables with a common CDF F_0. Let F_n be their ECDF and let F any CDF. If F \neq F_n then L(F)

Proof

Let z_a different values in the set {X_1,X_2,...,X_n}} and we can assume that n_j \geq 1 represent the number of X_i that are equal to z_j.

We can define p_j = F(z_j) +F(z_j-) and assuming the probability \hat p_j = \frac{n_j}{n}.

For the case when p_j =0 for any j=1,....,m then we have that the L(F) =0< L(F_n)

And for the case when all p_j >0 and for at least one p_j \neq \hat p_j we know that log(x) \leq x-1 for all the possible values x>0. So then we can define the following ratio like this:

log (\frac{L(F)}{L(F_n)}) = \sum_{j=1}^m n_j log (\frac{p_j}{\hat p_j})

log (\frac{L(F)}{L(F_n)}) = n \sum_{j=1}^m \hat p_j log(\frac{p_j}{\hat p_j})

log (\frac{L(F)}{L(F_n)}) < n\sum_{j=1}^m \hat p_j (\frac{p_j}{\hat p_j} -1)

So then we have that:

log (\frac{L(F)}{L(F_n)}) \leq 0

And the log for a number is 0 or negative when the number is between 0 and 1, so then on this case we can ensure that L(F) \leq L(F_n)

And with that we complete the proof.

8 0
4 years ago
Please help it’s due in an hour
dolphi86 [110]
I think that the answer is C
3 0
3 years ago
Solve for x.<br> 6x - 3x = 12
expeople1 [14]

Answer:

x=4

Step-by-step explanation:

3x = 12

divide by 3

x =12/3

8 0
3 years ago
PLZ HELP ASAP BEFORE I GET IT WRONG!!!
lord [1]

A. $960.

B. $940?

c. Neither.

I hope thiss helped! I could be wrong, but I do believe A. and C. are correct.

5 0
4 years ago
Will give brainiest Find the equation of the straight line parallel to the y-axis and passes through the point (-2, 3). _____
IrinaVladis [17]

Answer:

Step-by-step explanation:

8 0
2 years ago
Other questions:
  • Two balls are drawn in succession out of a box containing 5 red and 5 white balls. Find the probability that at least 1 ball was
    5·1 answer
  • 1. Increase £92 by 40%
    5·1 answer
  • the price of a DVD is $19 this price is 12% lower than last week what was the price of the DVD last week round your answer to th
    12·1 answer
  • The polynomial of degree 4, P(x) has a root of multiplicity 2 at x=4 and roots of multiplicity 1 at x =0 and x= -4. It goes thro
    7·1 answer
  • Write an equivalent expressions for (8a2 -15a + 9) - (6a2 - 9a - 20).
    14·1 answer
  • The sum of the two numbers is 12, and their product is -28.
    7·1 answer
  • If 5b=6a+16 and 9a=7b-20, then what are the values of a and b? show work.
    10·1 answer
  • Gcf/ greatest common factor and / LCM least common multiple Mang Andoy is going to put in trays of 6 eggs and 12 eggs. What is t
    8·1 answer
  • - If you can buy one jar of crushed ginger
    15·1 answer
  • 0.326<br> In stranded form pleasee
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!