![Finite Mathematics](https://www.bartleby.com/isbn_cover_images/9781337280426/9781337280426_largeCoverImage.gif)
Resource Allocation The Enormous State University History Department offers three courses-Ancient. Medieval, and Modem History-and the department chairperson is trying to decide how many sections of each to offer this semester. The department may offer up to 45 sections total, up to 5,000 students would like to take a course, and there are 60 professors to teach them. (No student will take more than one history course, and no professor will teach more than one section.) Sections of Ancient History have 100 students each, sections of Medieval History have 50 students each, and sections of Modem History have 200 students each. Modern History sections are taught by a team of two professors, while Ancient History and Medieval History need only one professor per section. Ancient History nets the university $10,000 per section, Medieval nets $20,000 per section, and Modem History nets $30,000 per section. How many sections of each course should the department offer in order to generate the largest profit? What is the largest profit possible? Will there be any unused time lots, any students who did not get into classes, or any professors without anything to teach?
![Check Mark](/static/check-mark.png)
Trending nowThis is a popular solution!
![Blurred answer](/static/blurred-answer.jpg)
Chapter 5 Solutions
Finite Mathematics
- Question 1. Let f: XY and g: Y Z be two functions. Prove that (1) if go f is injective, then f is injective; (2) if go f is surjective, then g is surjective. Question 2. Prove or disprove: (1) The set X = {k € Z} is countable. (2) The set X = {k EZ,nЄN} is countable. (3) The set X = R\Q = {x ER2 countable. Q} (the set of all irrational numbers) is (4) The set X = {p.√2pQ} is countable. (5) The interval X = [0,1] is countable. Question 3. Let X = {f|f: N→ N}, the set of all functions from N to N. Prove that X is uncountable. Extra practice (not to be submitted). Question. Prove the following by induction. (1) For any nЄN, 1+3+5++2n-1 n². (2) For any nЄ N, 1+2+3++ n = n(n+1). Question. Write explicitly a function f: Nx N N which is bijective.arrow_forward3. Suppose P is the orthogonal projection onto a subspace E, and Q is the orthogonal projection onto the orthogonal complement E. (a) The combinations of projections P+Q and PQ correspond to well-known oper- ators. What are they? Justify your answer. (b) Show that P - Q is its own inverse.arrow_forwardAre natural logarithms used in real life ? How ? Can u give me two or three ways we can use them. Thanksarrow_forward
- By using the numbers -5;-3,-0,1;6 and 8 once, find 30arrow_forwardShow that the Laplace equation in Cartesian coordinates: J²u J²u + = 0 მx2 Jy2 can be reduced to the following form in cylindrical polar coordinates: 湯( ди 1 8²u + Or 7,2 მ)2 = 0.arrow_forwardDraw the following graph on the interval πT 5π < x < x≤ 2 2 y = 2 cos(3(x-77)) +3 6+ 5 4- 3 2 1 /2 -π/3 -π/6 Clear All Draw: /6 π/3 π/2 2/3 5/6 x 7/6 4/3 3/2 5/311/6 2 13/67/3 5 Question Help: Video Submit Question Jump to Answerarrow_forward
- Not use ai pleasearrow_forwardSolve the equation. Write the smaller answer first. 2 (x-6)² = 36 x = Α x = Previous Page Next Pagearrow_forwardWrite a quadratic equation in factored form that has solutions of x = 2 and x = = -3/5 ○ a) (x-2)(5x + 3) = 0 ○ b) (x + 2)(3x-5) = 0 O c) (x + 2)(5x -3) = 0 ○ d) (x-2)(3x + 5) = 0arrow_forward
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningAlgebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningCollege AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9781285463247/9781285463247_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305071742/9781305071742_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305115545/9781305115545_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781938168383/9781938168383_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780547587776/9780547587776_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305652231/9781305652231_smallCoverImage.gif)