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
Ivan
3 years ago
13

You and five of your friends like to go to McDonalds once a week and get Happy Meals for the prize inside. McDonalds has just st

arted a new "dinosaur toy" promotion for their Happy Meals with six different dinosaurs you can collect: Brachiosaurus, Brontosaurus, Diplodocus, Tyrannosaurus, Plesiosaurus, and Allosaurus. You each want to collect at least one of all six dinosaurs, but the prizes are randomly placed in Happy Meals, and there is no way to know which dinosaur you're getting until you open the Happy Meal bag. How might you design a simulation experiment to find the likelihood (experimental probability) of getting all six toys after one, two, three, etc. Weeks?
Mathematics
1 answer:
Pavel [41]3 years ago
8 0

Answer:

The most suitable experimental simulation to find the probability of getting the six toys is by rolling the dice and recording the occurrences.

Step-by-step explanation:

As there are a total of 6 different dinosaurs, the probability of each of them is given as

P(X=one dinosaur)=1/6

In order to design an experiment, as the data is completely random and unknown, thus the experiment is designed such that the probability of individual option is 1/6.

In this regard the most suitable option is rolling a dice, numerous times and recording the occurrences accordingly.

You might be interested in
The slope of (4,-1) (-1,4)
olchik [2.2K]

Answer:

3

Step-by-step explanation: calculator

8 0
3 years ago
The plane x+y+2z=8 intersects the paraboloid z=x2+y2 in an ellipse. Find the points on this ellipse that are nearest to and fart
DiKsa [7]

Answer:

The minimum distance of   √((195-19√33)/8)  occurs at  ((-1+√33)/4; (-1+√33)/4; (17-√33)/4)  and the maximum distance of  √((195+19√33)/8)  occurs at (-(1+√33)/4; - (1+√33)/4; (17+√33)/4)

Step-by-step explanation:

Here, the two constraints are

g (x, y, z) = x + y + 2z − 8  

and  

h (x, y, z) = x ² + y² − z.

Any critical  point that we find during the Lagrange multiplier process will satisfy both of these constraints, so we  actually don’t need to find an explicit equation for the ellipse that is their intersection.

Suppose that (x, y, z) is any point that satisfies both of the constraints (and hence is on the ellipse.)

Then the distance from (x, y, z) to the origin is given by

√((x − 0)² + (y − 0)² + (z − 0)² ).

This expression (and its partial derivatives) would be cumbersome to work with, so we will find the the extrema  of the square of the distance. Thus, our objective function is

f(x, y, z) = x ² + y ² + z ²

and

∇f = (2x, 2y, 2z )

λ∇g = (λ, λ, 2λ)

µ∇h = (2µx, 2µy, −µ)

Thus the system we need to solve for (x, y, z) is

                           2x = λ + 2µx                         (1)

                           2y = λ + 2µy                       (2)

                           2z = 2λ − µ                          (3)

                           x + y + 2z = 8                      (4)

                           x ² + y ² − z = 0                     (5)

Subtracting (2) from (1) and factoring gives

                     2 (x − y) = 2µ (x − y)

so µ = 1  whenever x ≠ y. Substituting µ = 1 into (1) gives us λ = 0 and substituting µ = 1 and λ = 0  into (3) gives us  2z = −1  and thus z = − 1 /2 . Subtituting z = − 1 /2  into (4) and (5) gives us

                            x + y − 9 = 0

                         x ² + y ² +  1 /2  = 0

however, x ² + y ² +  1 /2  = 0  has no solution. Thus we must have x = y.

Since we now know x = y, (4) and (5) become

2x + 2z = 8

2x  ² − z = 0

so

z = 4 − x

z = 2x²

Combining these together gives us  2x²  = 4 − x , so

2x²  + x − 4 = 0 which has solutions

x =  (-1+√33)/4

and

x = -(1+√33)/4.

Further substitution yeilds the critical points  

((-1+√33)/4; (-1+√33)/4; (17-√33)/4)   and

(-(1+√33)/4; - (1+√33)/4; (17+√33)/4).

Substituting these into our  objective function gives us

f((-1+√33)/4; (-1+√33)/4; (17-√33)/4) = (195-19√33)/8

f(-(1+√33)/4; - (1+√33)/4; (17+√33)/4) = (195+19√33)/8

Thus minimum distance of   √((195-19√33)/8)  occurs at  ((-1+√33)/4; (-1+√33)/4; (17-√33)/4)  and the maximum distance of  √((195+19√33)/8)  occurs at (-(1+√33)/4; - (1+√33)/4; (17+√33)/4)

4 0
3 years ago
What is the measure of x?
bogdanovich [222]

Answer:

22

Step-by-step explanation:

This is a right angle so the sum of those would be equal to 90 degrees

x + 7 + 3x - 5 = 90 add like terms

4x + 2 = 90 subtract 2 from both sides

4x = 88 divide both sides by 4

x = 22

8 0
3 years ago
What is the answer to this please help
Elis [28]

Answer:

use calculater please it will not take long

4 0
2 years ago
Read 2 more answers
Volume of a polygon
diamong [38]

Answer: The formula for the volume of a polygon is  1/2 x perimeter x apothem

7 0
3 years ago
Other questions:
  • Listed below are speeds (mi/h) measured from southbound traffic on I-280 near Cupertino, California (based on data from SigAlert
    7·1 answer
  • Can someone write a full proof for #20?
    10·1 answer
  • Please someone help me
    14·2 answers
  • An ice cream stand uses the expression 2+ 0.5x to determine the cost in Dollars of an ice cream cone that has x amount of scoops
    12·1 answer
  • What are the main differences between the Greatest Common Factor and the Least Common Multiple of a pair of number? Use the numb
    11·2 answers
  • Match each set of numbers with their least common multiple
    12·1 answer
  • I need to know what the answer is
    6·1 answer
  • The _____ a0 of a segment divides the segment into two segments of equal length.
    9·2 answers
  • Latoya buys candy that costs 5 per pound. She will spend more than $30 on candy. What are the possible numbers of pounds she wil
    9·2 answers
  • Please answer this :)
    11·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!