Finite Mathematics Quiz: Choosing Methods
20 questions · exam conditions
0:00
Choosing MethodsQuestion 1 of 20

A marketing research firm has collected data on customer demographics, purchase history, and satisfaction ratings for 500 customers across three different product categories. The firm wants to predict which customers are most likely to respond positively to a new product launch campaign, and they have historical data showing response rates for similar campaigns based on various customer characteristics.

What mathematical approach would be most effective for developing a predictive model to identify high-probability responders?

Linear programming to optimize the selection of customers for maximum campaign effectiveness
Matrix operations to organize and analyze the multidimensional customer characteristic data
Probability analysis using conditional probabilities and historical response rate patterns
Financial mathematics to calculate the net present value of expected campaign returns
← Back to quizzes

Finite Mathematics Quiz

Finite Mathematics Quiz: Choosing Methods

Practice Choosing Methods in Finite Mathematics with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Choosing Methods, giving you a quick way to practice the rules, question types, and explanations that matter most for Finite Mathematics.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

A marketing research firm has collected data on customer demographics, purchase history, and satisfaction ratings for 500 customers across three different product categories. The firm wants to predict which customers are most likely to respond positively to a new product launch campaign, and they have historical data showing response rates for similar campaigns based on various customer characteristics.

What mathematical approach would be most effective for developing a predictive model to identify high-probability responders?

  1. Linear programming to optimize the selection of customers for maximum campaign effectiveness
  2. Matrix operations to organize and analyze the multidimensional customer characteristic data
  3. Probability analysis using conditional probabilities and historical response rate patterns (correct answer)
  4. Financial mathematics to calculate the net present value of expected campaign returns
Explanation: This is fundamentally a prediction problem based on historical patterns and conditional relationships between customer characteristics and response behavior, making probability analysis the most appropriate approach. Choice A would be used after identifying likely responders, not for the prediction itself. Choice B organizes data but doesn't create predictive models. Choice D evaluates financial outcomes but doesn't address the core prediction challenge.

Question 2

A transportation company operates a network connecting 6 cities. The company has data on travel times, fuel costs, and demand between each pair of cities. Due to new regulations, the company must restructure its routes to minimize total operating costs while ensuring that each city is connected to the network and that no route exceeds 8 hours of travel time.

Which mathematical framework would be most appropriate for solving this network restructuring problem?

  1. Financial mathematics to calculate the net present value of cost savings from route optimization
  2. Probability theory to model demand fluctuations and their impact on route profitability
  3. Linear programming to minimize costs subject to connectivity and time constraints (correct answer)
  4. Matrix algebra to represent the network structure and calculate shortest paths between cities
Explanation: This is a network optimization problem with an objective function (minimize costs) subject to constraints (connectivity requirements and time limits), which is solved using linear programming. Choice A evaluates financial outcomes but doesn't solve the routing problem. Choice B models uncertainty but doesn't address the optimization aspect. Choice D can represent and analyze networks but doesn't handle the constrained optimization needed here.

Question 3

A quality control manager needs to determine the probability that a batch of products meets specifications, given that individual components have known failure rates and the final product requires all components to function properly. Historical data shows that Component A fails 3% of the time, Component B fails 5% of the time, and Component C fails 2% of the time, with failures occurring independently. Which approach should be used?

  1. Matrix operations to model the interdependencies between component failure modes
  2. Linear programming to optimize component reliability subject to cost constraints
  3. Financial analysis to determine the cost-benefit ratio of improved quality control measures
  4. Probability calculations using independence assumptions and complement rules (correct answer)
Explanation: When you encounter a problem involving multiple components that must all work together, and you're given individual failure rates that occur independently, this is a classic probability scenario requiring the multiplication rule and complement rule. Since the final product requires all components to function properly, you need to find the probability that none of the components fail. With independent events, you can multiply the individual success probabilities. Component A succeeds 97% of the time (100% - 3%), Component B succeeds 95% of the time (100% - 5%), and Component C succeeds 98% of the time (100% - 2%). The probability all components work is: P(success)=0.97×0.95×0.98=0.903P(\text{success}) = 0.97 \times 0.95 \times 0.98 = 0.903 or about 90.3%. Option A is incorrect because matrix operations model complex interdependencies, but this problem explicitly states the failures are independent—no complex relationships need modeling. Option B is wrong because linear programming optimizes solutions subject to constraints, but you're not optimizing anything here; you're calculating probability with given failure rates. Option C misses the mark entirely since this is asking for probability calculation, not financial cost-benefit analysis. Option D correctly identifies this as a probability problem using independence assumptions (multiply probabilities) and complement rules (convert failure rates to success rates). Study tip: When you see "independent" events and "all must work," immediately think: convert to success rates using complements, then multiply together. This pattern appears frequently in reliability and quality control problems.

Question 4

A project manager must allocate a team of 12 specialists among 4 different projects, where each specialist has different skill ratings for each project type, and each project has minimum staffing requirements and maximum budget constraints. The objective is to maximize overall project success probability based on team composition. Which analytical approach is most suitable?

  1. Matrix operations to calculate skill-match scores combined with probability theory for success modeling
  2. Linear programming to optimize allocation subject to staffing and budget constraints (correct answer)
  3. Probability analysis to determine the likelihood of project success under various team configurations
  4. Financial mathematics to evaluate the expected value of different allocation strategies
Explanation: This is fundamentally an assignment/allocation optimization problem with constraints (minimum staff, maximum budget) and an objective function (maximize success probability). Linear programming handles this type of constrained optimization. Choice A calculates components but doesn't solve the optimization. Choice C models outcomes but doesn't find the optimal allocation. Choice D evaluates strategies but doesn't identify the optimal solution.

Question 5

A manufacturing company must decide between expanding its current facility or building a new plant. The expansion costs $2.8 million upfront and increases capacity by 40%, while the new plant costs $5.2 million and doubles capacity. Both options involve 10-year financing at different rates, and market demand growth is uncertain. The decision must account for construction time, financing costs, and demand uncertainty. What analytical approach is most appropriate?

  1. Probability analysis to model demand scenarios combined with present value calculations for financial comparison (correct answer)
  2. Linear programming to optimize the capacity expansion subject to financial and operational constraints
  3. Matrix operations to organize cost and capacity data for systematic comparison of alternatives
  4. Financial mathematics focusing on loan amortization schedules and interest rate comparisons
Explanation: This decision involves both uncertain demand (requiring probability analysis for different growth scenarios) and time-value considerations (requiring present value analysis to properly compare the multi-year financial implications of each option). Choice B treats this as an optimization problem rather than a comparison between discrete alternatives. Choice C organizes information but doesn't address uncertainty or time value. Choice D focuses only on financing mechanics without considering demand uncertainty or comprehensive financial comparison.

Question 6

A insurance company is developing a new policy and needs to set premium rates based on customer risk profiles. They have historical claims data for 10,000 customers, including age, driving record, location, and claim amounts. The company wants to predict claim probability for new customers and set premiums that ensure profitability while remaining competitive.

Which mathematical framework would be most appropriate for developing this pricing model?

  1. Linear programming to optimize premium levels subject to profitability and competitive constraints
  2. Probability analysis using historical data to model claim likelihood and expected claim amounts (correct answer)
  3. Matrix operations to organize customer characteristic data and identify correlation patterns
  4. Financial mathematics to calculate present value of future claim payments and premium income
Explanation: This is primarily a risk assessment and prediction problem requiring probability analysis to model claim likelihood based on customer characteristics and historical patterns. The pricing model depends on accurately predicting expected claims. Choice A optimizes prices but requires the probability model first. Choice C organizes data but doesn't create the predictive model. Choice D evaluates financial timing but doesn't address the core risk prediction challenge.

Question 7

A small electronics manufacturer produces two models of wireless speakers: the Standard model and the Premium model. The company has constraints on labor hours, materials, and storage space. The Standard model requires 2 hours of labor and 3 units of materials per unit, while the Premium model requires 4 hours of labor and 2 units of materials per unit. The company has 240 labor hours and 180 units of materials available per week. Storage capacity allows for at most 80 units total. The Standard model generates $15 profit per unit, and the Premium model generates $25 profit per unit. Additionally, market research shows that the probability of selling any given Premium unit is 0.7, while Standard units always sell.

To maximize expected weekly profit, which mathematical approach would be most appropriate for this scenario?

  1. Linear programming with constraints on labor, materials, and storage, using expected profit coefficients (correct answer)
  2. Probability tree analysis to determine all possible sales outcomes and their associated profits
  3. Matrix operations to solve the system of constraint equations simultaneously for optimal production
  4. Financial mathematics using present value calculations to account for uncertain future sales revenue
Explanation: This is fundamentally a resource allocation optimization problem with constraints, which is the domain of linear programming. The uncertainty in Premium sales can be incorporated by using expected profit ($25 × 0.7 = $17.50) as the objective function coefficient. Choice B focuses only on probability without addressing optimization. Choice C treats this as a system of equations rather than an optimization problem. Choice D incorrectly applies time-value concepts to what is essentially a production planning problem.

Question 8

A company manufactures two types of furniture, chairs and tables. Each chair requires 2 hours of carpentry and 1 hour of finishing. Each table requires 3 hours of carpentry and 2 hours of finishing. The company has 120 hours of carpentry and 70 hours of finishing available each week. The profit is $30 per chair and $50 per table. The company wants to determine the number of chairs and tables to produce each week to achieve the greatest possible profit. Which of the following methods is most appropriate to solve this problem?

  1. Linear programming to maximize a profit function subject to constraints on available hours. (correct answer)
  2. Using matrices to solve the system of linear equations representing production requirements.
  3. Financial mathematics to calculate the future value of the profits from furniture sales.
  4. Probability theory to determine the likelihood of selling all the furniture produced.
Explanation: The problem asks to maximize a quantity (profit) which is a linear function of two variables (number of chairs, number of tables), subject to several linear inequalities (constraints on carpentry and finishing hours). This is the classic structure of a linear programming problem.

Question 9

A couple is taking out a $300,000 loan to purchase a house. The loan has a term of 30 years with a fixed annual interest rate of 6%, compounded monthly. They want to calculate their required monthly payment to pay off the loan in exactly 30 years. Which mathematical tool is specifically designed for this type of problem?

  1. Bayes' theorem to update the probability of loan approval based on their financial information.
  2. A matrix model representing the loan balance and payments over each of the 360 months.
  3. A linear programming model to minimize the total interest paid over the life of the loan.
  4. The amortization formula, which is derived from the present value of an ordinary annuity formula. (correct answer)
Explanation: When you encounter a problem asking for the monthly payment on a fixed-rate loan, you're dealing with an amortization problem. This type of question requires you to find equal periodic payments that will completely pay off a loan principal plus interest over a specified time period. The amortization formula is specifically designed for this scenario. It calculates the fixed payment amount needed to pay off a loan by treating the loan as the present value of an ordinary annuity. The monthly payments represent the annuity payments, and the loan amount ($300,000) is the present value of all those future payments discounted at the monthly interest rate (6%/12 = 0.5%). The formula accounts for both principal repayment and interest charges over the 360-month term. Option A is incorrect because Bayes' theorem deals with conditional probability and updating probabilities based on new information—it has nothing to do with calculating loan payments. Option B is wrong because while you could theoretically create a matrix to track payments, matrices aren't the standard mathematical tool for this calculation and would be unnecessarily complex. Option C is incorrect because this isn't an optimization problem—the payment amount is determined by the loan terms, not minimized through linear programming. Remember this pattern: when you see fixed periodic payments to pay off a debt over time, think amortization formulas derived from present value of annuities. Keywords like "monthly payment," "fixed rate," and "pay off the loan" should immediately signal this approach on finite mathematics exams.

Question 10

An electronics company has two manufacturing plants, A and B, and three distribution centers, X, Y, and Z. Plant A can produce 1,000 units and Plant B can produce 1,500 units per week. Centers X, Y, and Z require 800, 900, and 600 units, respectively. The shipping costs from each plant to each center are known. The company's goal is to determine how many units to ship from each plant to each distribution center to meet all demand while minimizing the total shipping cost. Which method should be used?

  1. Calculating the expected shipping cost using probability, assuming that shipment routes are chosen randomly.
  2. A Leontief input-output matrix model to analyze how production in plants affects distribution.
  3. An absorbing Markov chain to model the flow of units from production to their final destination.
  4. Linear programming, to minimize a total cost function subject to supply and demand constraints. (correct answer)
Explanation: When you encounter an optimization problem involving limited resources, specific constraints, and a goal to minimize or maximize something, you're looking at a classic linear programming scenario. This problem has all the hallmarks: fixed supply capacities, specific demand requirements, and an objective to minimize total shipping costs. Linear programming (option D) is the correct approach because you need to minimize the objective function (total shipping cost) while satisfying multiple constraints: Plant A can supply at most 1,000 units, Plant B can supply at most 1,500 units, and each distribution center must receive exactly what it demands (800, 900, and 600 units respectively). The decision variables would be the quantities shipped from each plant to each center. Option A is incorrect because this isn't a probability problem—you're not dealing with random events or uncertain outcomes. The shipping costs and requirements are known and fixed. Option B misapplies input-output analysis, which examines interdependencies between economic sectors, not transportation optimization. The Leontief model would be relevant for understanding how changes in one industry affect others, not for routing decisions. Option C incorrectly suggests using absorbing Markov chains, which model systems that eventually reach absorbing states. While units do flow from plants to centers, this is a one-time allocation problem, not a probabilistic process over time. Remember: when you see "minimize/maximize" combined with "subject to constraints" involving supplies, demands, or capacities, think linear programming. This is one of the most practical applications of linear programming in business operations.

Question 11

An island's economy consists of two sectors: agriculture (A) and tourism (T). To produce $1 of output, the agriculture sector requires $0.20 of its own products and $0.30 of tourism services. To produce $1 of output, the tourism sector requires $0.10 of agricultural products and $0.25 of its own services. There is an external demand for $50 million in agriculture and $80 million in tourism. To determine the total production level required from each sector to meet both internal and external demand, which method is the most direct?

  1. A financial model calculating the present value of the island's future economic output.
  2. A linear programming model to minimize the cost of production for the entire economy.
  3. A Leontief input-output model using matrix algebra to solve the equation X = AX + D. (correct answer)
  4. A Markov chain model of the flow of money between the two sectors to find an economic equilibrium.
Explanation: When you encounter a problem describing how economic sectors depend on each other's outputs to produce their own goods, you're looking at an input-output analysis problem. The key clue is the specific numerical requirements each sector needs from itself and others to produce $1 of output. This is exactly what the Leontief input-output model handles. You can organize the internal requirements into a matrix $AA whereentrywhere entry (i,j)(i,j) representshowmuchsectorrepresents how much sector ii needsfromsectorneeds from sector jj toproduceto produce1 of output. Here, A=(0.200.100.300.25)A = \begin{pmatrix} 0.20 & 0.10 \\ 0.30 & 0.25 \end{pmatrix} . The external demand becomes vector D=(5080)D = \begin{pmatrix} 50 \\ 80 \end{pmatrix} . The equation X=AX+DX = AX + D captures that total production XX must equal internal consumption AXAX plus external demand DD. Solving gives you the required production levels. Option A is wrong because present value calculations deal with time value of money, not interdependent production requirements. Option B incorrectly suggests this is an optimization problem when you actually need to find specific production levels to meet given demands, not minimize costs. Option D misapplies Markov chains, which model probabilistic transitions between states over time, not the deterministic input-output relationships described here. Remember: When you see specific numerical coefficients describing how much each sector needs from others to produce its output, plus external demand figures, think Leontief input-output model and the equation X=AX+DX = AX + D.

Question 12

A nutritionist is designing a dietary supplement using a blend of two ingredients, X and Y. Each ounce of X provides 20 units of vitamin A and 10 units of vitamin C. Each ounce of Y provides 15 units of vitamin A and 30 units of vitamin C. The supplement must provide at least 150 units of vitamin A and 180 units of vitamin C per serving. The costs of the ingredients are known. The goal is to find the amount of each ingredient that meets these nutritional requirements at the lowest possible cost. What is the most appropriate mathematical framework for this problem?

  1. Probability theory to find the likelihood that a random blend meets the vitamin requirements.
  2. Solving a system of two linear equations to find the exact amounts of ingredients required.
  3. Linear programming, to minimize cost subject to inequality constraints for each vitamin. (correct answer)
  4. Matrix algebra to represent the nutritional content and the required amounts in a table.
Explanation: When you encounter optimization problems with constraints and a specific objective (like minimizing cost), you're looking at a classic linear programming scenario. This problem has all the key elements: decision variables (amounts of X and Y), an objective function (minimize cost), and constraint inequalities. Linear programming is the correct framework here because you need to minimize cost while satisfying multiple nutritional requirements. The constraints are inequalities: you need at least 150 units of vitamin A and at least 180 units of vitamin C. These create a feasible region where any combination of ingredients meeting both requirements is acceptable, and linear programming finds the optimal point within this region. Option A is incorrect because probability theory deals with random events and uncertainty, not optimization with known nutritional values and requirements. There's nothing probabilistic about this deterministic optimization problem. Option B misses the mark because this isn't about solving for exact amounts using equalities. You need at least certain vitamin levels, creating inequalities, not equations. Plus, there are infinitely many combinations that could meet the minimum requirements—you need optimization to find the best one. Option D confuses the tool with the framework. While matrices might be used to organize the data, matrix algebra alone doesn't solve optimization problems. It's a computational tool, not a problem-solving framework for minimizing cost subject to constraints. Remember: whenever you see "minimize" or "maximize" something subject to constraint inequalities (at least, at most), think linear programming. The combination of optimization objective plus inequality constraints is the telltale signature.

Question 13

A public health official is modeling the progression of a non-lethal virus in a closed population. Individuals are classified as either Susceptible (S), Infected (I), or Recovered (R). Each week, known percentages of people transition between these states (e.g., 10% of Susceptible people become Infected, 50% of Infected people Recover, etc.). To predict the percentages of the population in each category several months in the future, which tool is most effective?

  1. An amortization schedule to model the decay of the infected population over time.
  2. A Markov chain with a transition matrix representing the weekly probability of moving between states. (correct answer)
  3. Bayes' theorem to update the probability that a specific individual is infected, given a positive test.
  4. A linear programming model to minimize the number of infected individuals in the population.
Explanation: When you encounter a problem involving transitions between different states over time with known probabilities, you're looking at a classic Markov chain scenario. The key indicator here is that people move between three distinct categories (S, I, R) with specific weekly transition percentages. A Markov chain with a transition matrix is perfect for this situation because it captures the probabilistic nature of state changes over discrete time periods. Each element in the transition matrix represents the probability of moving from one state to another (or staying in the same state) during one time step. By multiplying the current population distribution by this transition matrix repeatedly, you can predict future population percentages weeks or months ahead. This mathematical tool is specifically designed for modeling systems where the next state depends only on the current state, not the history. Option A is incorrect because amortization schedules model fixed payments over time, not probabilistic transitions between multiple states. Option C misapplies Bayes' theorem, which updates probabilities based on new evidence (like test results) rather than modeling population-level transitions over time. Option D suggests linear programming, but this is an optimization technique for finding the best solution under constraints—not a tool for predicting natural disease progression with fixed transition probabilities. Remember: whenever you see a problem describing movement between distinct categories with known transition probabilities over regular time intervals, think Markov chains. The transition matrix approach is the standard mathematical tool for these "state-to-state" probability problems in finite mathematics.

Question 14

A factory produces light bulbs with a historical defect rate of 3%. A quality control manager selects a random sample of 20 bulbs for testing. The manager wants to determine the probability that exactly one bulb in the sample is defective. Which mathematical method is the correct one to use?

  1. Linear programming to optimize the sampling process and minimize the total number of defects detected.
  2. The binomial probability formula, for a fixed number of independent trials with two outcomes. (correct answer)
  3. A transition matrix to model the changing state of the production line between good and defective bulbs.
  4. The expected value calculation to find the average number of defective bulbs expected in the sample.
Explanation: When you encounter a problem involving a fixed number of trials, each with the same probability of success or failure, you're looking at a binomial probability situation. This scenario has all the key characteristics: 20 independent trials (bulbs), each with exactly two possible outcomes (defective or not defective), and a constant probability of "success" (3% defect rate). The binomial probability formula is perfect here because you want the probability of exactly one defective bulb out of 20 trials. You'd calculate this using P(X=1)=(201)(0.03)1(0.97)19P(X = 1) = \binom{20}{1}(0.03)^1(0.97)^{19}, where you're finding the probability of exactly 1 success in 20 trials. Option A is incorrect because linear programming is an optimization technique used to maximize or minimize objective functions subject to constraints - it doesn't calculate probabilities. Option C suggests using a transition matrix, which models systems that change states over time (like Markov chains), but this problem involves independent trials, not state transitions. Option D mentions expected value calculation, which would give you the average number of defective bulbs (0.6 bulbs), not the probability of finding exactly one defective bulb. Remember this pattern: when you see "exactly X successes," "fixed number of trials," and "constant probability," think binomial distribution. The key words "exactly," "independent trials," and specific probability values are strong signals that you need the binomial probability formula, not optimization or transition models.

Question 15

A city's parks department has a budget of $500,000 for new projects. They are considering five potential projects, each with a specific cost and a calculated 'community benefit score.' The department cannot fund projects partially; a project must be fully funded or not at all. The goal is to select the combination of projects that provides the maximum total community benefit score without exceeding the budget. Which method is best suited for this decision-making process?

  1. A Leontief input-output model to see how the projects affect other city departments.
  2. Integer linear programming, where binary variables represent whether to fund each project. (correct answer)
  3. The future value of an annuity formula to determine the long-term financial return of the projects.
  4. A probability distribution to model the uncertainty of project costs and benefits.
Explanation: When you encounter a problem involving selecting from multiple options with constraints and the goal of optimizing some outcome, you're looking at an optimization problem. The key details here are that projects must be funded completely or not at all (no partial funding) and you want to maximize benefit while staying within budget. This is a classic knapsack problem that requires integer linear programming. You'd create binary variables (0 or 1) for each project, where 1 means "fund the project" and 0 means "don't fund it." Your constraint would be that the sum of (cost × binary variable) for all projects ≤ $500,000, and your objective would be to maximize the sum of (benefit score × binary variable). The integer programming solver finds the optimal combination of yes/no decisions. Looking at why the other options don't fit: (A) Leontief input-output models analyze how economic sectors affect each other through supply chains, not project selection decisions. (C) Future value of annuity formulas calculate compound growth of regular payments over time, which doesn't help you choose between discrete projects. (D) While probability distributions could model uncertainty, the question presents this as a deterministic problem with known costs and benefits. Study tip: When you see "all-or-nothing" decisions (can't do something partially) combined with resource constraints and optimization goals, think integer programming with binary variables. This pattern appears frequently in resource allocation, scheduling, and investment selection problems.

Question 16

An individual plans to save for retirement by depositing $500 at the end of each month into an account that pays 4.8% annual interest, compounded monthly. To calculate the total amount of money that will be in the account after 25 years, which of the following is the most suitable method?

  1. A linear programming model to maximize the account balance.
  2. The standard compound interest formula A = P(1 + r/n)^(nt).
  3. The future value of an ordinary annuity formula. (correct answer)
  4. Calculating the expected value of the account, assuming a variable interest rate.
Explanation: When you encounter a problem involving regular, equal payments made over time with compound interest, you're dealing with an annuity situation. The key indicator here is the phrase "depositing $500 at the end of each month" – this signals a series of periodic payments, not a single lump sum investment. The future value of an ordinary annuity formula (option C) is exactly what you need here. This formula calculates the total value when you make regular payments that each earn compound interest for different lengths of time. The formula is $FV=PMT×[(1+r)n1]rFV = PMT \times \frac{[(1 + r)^n - 1]}{r} $, where PMT is the monthly payment, r is the monthly interest rate, and n is the number of payments. Option A is incorrect because linear programming is used for optimization problems with constraints – there's nothing to optimize here, just a straightforward calculation. Option B represents the compound interest formula for a single lump sum investment, but this problem involves multiple payments made over time, not one initial deposit. Option D is wrong because the problem states a fixed 4.8% annual rate, not a variable rate requiring expected value calculations. Study tip: Always distinguish between single payment problems (use compound interest formula) and multiple payment problems (use annuity formulas). Look for keywords like "monthly deposits," "annual payments," or "end of each period" to identify annuity situations on your finite mathematics exam.

Question 17

A charity lottery sells 10,000 tickets. There is one grand prize of $5,000, five second prizes of $500, and twenty third prizes of $100. To determine if a ticket is a worthwhile purchase on average, a statistician wants to calculate the average payout per ticket. What method is most suitable for this calculation?

  1. Calculating the expected value by summing the products of each prize amount and its corresponding probability. (correct answer)
  2. Using the formula for combinations to find the number of ways the prizes can be distributed among ticket holders.
  3. Setting up a linear program to maximize winnings based on the number of tickets purchased.
  4. Using the compound interest formula to see how the prize money could grow over time as an investment.
Explanation: The average payout of a random event like a lottery is its expected value. This is calculated by multiplying the value of each outcome (the prize amounts, including $0 for losing tickets) by its probability of occurring, and then summing these products. This gives the long-run average value per ticket.

Question 18

Urban planners are studying population shifts between a city's downtown, suburbs, and rural areas. Each year, a fixed percentage of residents from each area moves to the other two areas. For example, 10% of downtown residents move to the suburbs and 5% move to rural areas. To predict the population distribution in the long run, assuming these trends continue, which mathematical approach should be used?

  1. Setting up a transition matrix and finding the steady-state vector for this Markov process. (correct answer)
  2. Using probability rules to find the chance that a single randomly chosen resident will live downtown after 20 years.
  3. Formulating a system of linear equations to find a point where population movement is equal for one year.
  4. Applying financial annuity formulas to model the economic impact of population changes in each area.
Explanation: This scenario describes a system with a finite number of states (downtown, suburbs, rural) and fixed probabilities of transitioning between states over discrete time intervals (years). This is a Markov process. To find the long-run distribution, one would set up a transition matrix representing these probabilities and calculate its steady-state vector.

Question 19

A game consists of two stages. First, a fair six-sided die is rolled. If the result is even, the player draws one marble from Bag A. If the result is odd, the player draws one marble from Bag B. Bag A contains 3 red and 7 blue marbles. Bag B contains 6 red and 2 blue marbles. To find the overall probability that a player draws a red marble, which approach is most appropriate?

  1. Modeling the process as a two-state Markov chain to find the long-term probability of drawing red.
  2. Setting up a game theory payoff matrix to determine the optimal strategy for the player.
  3. Using combinations to count the total number of red marbles and divide by the total number of all marbles.
  4. Using a probability tree or the law of total probability, considering the conditional probabilities. (correct answer)
Explanation: When you encounter a problem involving multiple stages where the outcome of one stage determines what happens next, you're dealing with conditional probability. This type of problem requires you to consider all possible paths to your desired outcome. The correct approach is D - using a probability tree or the law of total probability. Here's why: You need to account for both ways to draw a red marble. First path: roll even (probability 12\frac{1}{2}), then draw red from Bag A (probability 310\frac{3}{10}). Second path: roll odd (probability 12\frac{1}{2}), then draw red from Bag B (probability 68=34\frac{6}{8} = \frac{3}{4}). The total probability is 12×310+12×34=320+38=2140\frac{1}{2} \times \frac{3}{10} + \frac{1}{2} \times \frac{3}{4} = \frac{3}{20} + \frac{3}{8} = \frac{21}{40}. A is wrong because Markov chains model systems that transition between states over time - this is a single-round game, not a long-term process. B is incorrect because game theory analyzes strategic decision-making between competing players - here there's no strategy involved, just probability. C fails because it ignores the die roll stage entirely; you can't simply combine all marbles since the bags aren't equally likely to be chosen. Study tip: Whenever you see "first this happens, then based on that result, this other thing happens," think conditional probability and probability trees. Look for multiple stages or pathways to reach the same outcome.

Question 20

A company is evaluating whether to lease or purchase equipment worth $150,000. The lease option requires monthly payments of $3,200 for 5 years with no residual value. The purchase option requires a down payment of $30,000 and financing the remainder at 6.5% annual interest with monthly payments over 5 years, after which the equipment will have a residual value of $25,000. Which method should be used to make this decision?

  1. Probability analysis to assess the likelihood of equipment value retention over the 5-year period
  2. Present value calculations to compare the total cost of both options in today's dollars (correct answer)
  3. Linear programming to minimize total payments subject to cash flow constraints
  4. Matrix operations to systematically compare payment schedules and residual values
Explanation: This is a classic financial comparison requiring present value analysis to properly compare cash flows occurring at different times. The decision requires discounting all future payments and the residual value to present terms for accurate comparison. Choice A doesn't address the core financial comparison. Choice C isn't an optimization problem with multiple variables and constraints. Choice D organizes information but doesn't provide the time-value framework needed for proper comparison.