Concept explainers
A restaurant offers 20 appetizers and 40 main courses. In how many ways can a person order a two-course meal?
To calculate: The number of ways to order a two-course meal.
Answer to Problem 1RE
Solution:
The number of ways to order a two-course meal is
Explanation of Solution
Given:
Number of appetizers is 20, and the number of main courses is 40.
Formula used:
The Fundamental Counting Principle
If you can choose one item from a group of M items and a second item from a group of N items, then the total number of two-item choices is
Calculation:
The number of ways to order a two-course meal can be calculated by multiplying the given number of appetizers to the given number of the main courses.
Compute the number of ways to order two-course meal using the equation as shown below:
Want to see more full solutions like this?
Chapter 11 Solutions
Thinking Mathematically (7th Edition)
- 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
- College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningCollege AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
- Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,Algebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill