![Oso29](/avatars/28072.jpg)
Oso29
28.03.2020 •
Mathematics
The municipal swimming pool in Charlotte, North Carolina has three different ways of paying for individual open swimming. Nick is trying to decide which way to pay.
Early Pay: Pay $38.00 before Memorial Day; swim any number of days
Deposit Plus: $13.00 deposit plus $3.00 per day
Daily Pay: $5.00 per day
Answer the following questions:
1. Fill in the table with the cost to swim the given number of days. Each amount should be the total cost to swim that number of days, including the deposit if applicable. (Note: A deposit is a one time cost or fee collected or put down as part of a payment.)
Table of swimming costs using the three different payment methods (The picture)
2. Write an equation for each method of payment. Write your equations in slope-intercept form so that x is the number of days and y is the cost.
a. Early Pay:
b. Deposit Plus:
c. Daily Pay:
3. Graph each equation on the same set of axes so you can visually compare the payment methods. Let the horizontal axis be the number of days swimming, x, and the vertical axis the cost in dollars, y. You do not need to submit your graph. This is just to help you with answers to questions 4-6.
4. If Nick goes swimming 4 times, what would he need to pay with each payment plan? Which is the best payment method for him?
5. If Nick goes swimming 7 times, what would he need to pay with each payment plan? Which is the best payment method for him?
6. If Nick goes swimming 14 times, what would he need to pay with each payment plan? Which is the best payment method for him?
7. Nick’s youth group has 20 regular students that attend weekly get togethers. They saved up enough money for each person to go swimming 10 times each with the daily pay plan. After they saved that amount, they found out they can use the early pay plan and save money. They plan to donate their savings to the church since it’s in need of a new sound system. How much money will they be able to donate with the savings from all 20 youth? (Please show all your work for full credit)
Solved
Show answers
More tips
- S Style and Beauty How to Get Rid of Under Eye Bags?...
- C Computers and Internet How to Get Rid of Windows Genuine Check?...
- C Computers and Internet War of Social Media: Which Platform is the Leader?...
- H Health and Medicine How to Treat the Flu: A Comprehensive Guide...
- O Other What is a Disk Emulsifier and How Does it Work?...
- F Family and Home What does a newborn need?...
- F Family and Home Choosing the Right Car Seat for Your Child: Tips and Recommendations...
- F Food and Cooking How to Get Reconfirmation of Registration?...
- C Computers and Internet How to Get Rid of Spam in ICQ?...
- A Art and Culture Who Said The Less We Love a Woman, the More She Likes Us ?...
Answers on questions: Mathematics
- M Mathematics Graph the equation below. y= 5/4 x-1...
- M Mathematics A. -7/8 x1 1/3 B.-3/10 + -1/5 C. -1/2 / 1/4 D. 3 1/2 - 2 1/4...
- M Mathematics A public health expert is worried that a recent outbreak of a disease may be related to a batch of spinach from a certain farm. She wants to test the plants at the farm, but it will...
- M Mathematics If m 1 = (3x + 8) and m 5 = (4x - 2), find the value of x and m 2....
- B Business .What are economies of scale? Take an analysis example...
- M Mathematics amelia paid 360 for a watch after he had been allowed a discount 10% discount what was the marked price of the watch? and also put the formula...
Ответ:
Step-by-step explanation:
1] the minimum number of arcs in any strongly connected digraph with n vertices is 'n' . the graph look like a cycle
the graph is in the attached file
in a directed cycle we have strongly connected graph since we can reach any vertax from any vertax, it has minimum arc which is 'n'
since if we use less than n vertax then the given graph has atmost one tree which is not strongly connected graph.
2] the maximum distance between two vertax is 5 which from veratx 1 to vertax 6 distance is 5
1----->2------->3--------->4------->5-------->6
if we use cycle of n node then the maximum distance between two vertax is n-1