As of January 2016, Box Office Mojo reported that, the top 10 grossing movies of all of the time were listed in the table below. Define the following sets:
M=set of movies that earned more than
L=set of movies that earned less than
B=set of movies made before 2015
Movie | Year | Gross ($ billion) |
a. Avatar | 2009 |
|
b. Titanic | 1997 |
|
c. Jurassic World | 2015 |
|
d. The Avengers | 2012 |
|
e. Furious 7 | 2015 |
|
f. Age of Ultron | 2015 |
|
g. Deathly Hollows 2 | 2011 |
|
h. Frozen | 2013 |
|
i. Iron Man | 2013 |
|
h. Minions | 2015 |
|
In Exercises 65 – 70, describe each set in words, and then list its elements as a set. For example
Want to see the full answer?
Check out a sample textbook solutionChapter 2 Solutions
Mathematics All Around (6th Edition)
Additional Math Textbook Solutions
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Pathways To Math Literacy (looseleaf)
Elementary Statistics: Picturing the World (7th Edition)
College Algebra Essentials (5th Edition)
Precalculus
College Algebra (Collegiate Math)
- 30. (a) What is meant by the term "product measur"? ANDarrow_forward14. Define X-(H) for a given H E R. Provide a simple example.arrow_forwardLet G be a connected graph with n ≥ 2 vertices. Let A be the adjacency matrix of G. Prove that the diameter of G is the least number d such that all the non-diagonal entries of the matrix A are positive.arrow_forward
- find the general soultion (D-DxDy-2Dx)Z = sin(3x+4y) + x²yarrow_forward3. Show that (a) If X is a random variable, then so is |X|;arrow_forward8. [10 marks] Suppose that 15 people are at a dinner and that each person knows at least 9 of the others. Can the diners be seated around a circular table so that each person knows both of their immediate neighbors? Explain why your answer is correct.arrow_forward
- 19. Let X be a non-negative random variable. Show that lim nE (IX >n)) = 0. E lim (x)-0. = >arrow_forward9. [10 marks] Consider the following graph G. (a) Find the Hamilton closure of G. Explain why your answer is correct. (b) Is G Hamiltonian? Explain why your answer is correct.arrow_forward7. [10 marks] Let G = (V,E) be a 3-connected graph with at least 6 vertices. Let C be a cycle in G of length 5. We show how to find a longer cycle in G. Ꮖ (a) Let x be a vertex of G that is not on C. Show that there are three C-paths Po, P1, P2 that are disjoint except at the shared initial vertex x and only intersect C at their final vertices. (b) Show that at least two of Po, P1, P2 have final vertices that are adjacent along C.arrow_forward
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal LittellHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL