1. Suppose that a group of illegal counterfeiters print 1,000 copies of fake $20 bills and introduces them into the economy. Suppose that each bill is used once per week (starting in week 1), and that each time a bill is used, it has a 1 in 5 chance of being detected as fake. If it is detected, it is removed. If not, it is used again. (a) What does the expression I 1000 ()"* (}) represent? Explain. n=1 Suggestion: If you are unsure, try writing out the expression for n = 1,2,3 and consider what these might represent. (Ь) Find an expression of the form a, that represents the total expected number of transactions n=1 where one of the fake bills are successfully used without being detected. Then determine if your series converges or diverges, and find its sum, if possible. (c) E wards, each fake bill has a 1 in 3 chance of being detected at each transaction. In this case, what is the total expected number of times that the fake bills are successfully used in transactions without being detected? Suggestion: Start by writing expressions for the expected number of undetected transactions in week 1, week 2, week 3, week 4, etc. and think about ways to write all or part of this as a series. Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on- 3) Suppose now that instead of using a new detection tool starting in week 3, suppose we started (d) using it right away at the beginning of week 1. If we wanted the total expected number of transactions with the 1,000 fake bills to be at most 1,700 then what percentage would we need to detect at each transaction? Write your final answer as a percentage, and round to 2 decimal points.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
1. Suppose that a group of illegal counterfeiters print 1,000 copies of fake $20 bills and introduces them into the
economy. Suppose that each bill is used once per week (starting in week 1), and that each time a bill is used, it
has a 1 in 5 chance of being detected as fake. If it is detected, it is removed. If not, it is used again.
(a)
What does the expression 1000 (O" * ) represent? Explain.
n=1
Suggestion: If you are unsure, try writing out the expression for n = 1,2, 3 and consider what these might
represent.
(Б)
Find an expression of the form an that represents the total expected number of transactions
n=1
where one of the fake bills are successfully used without being detected. Then determine if your series
converges or diverges, and find its sum, if possible.
(c)
wards, each fake bill has a 1 in 3 chance of being detected at each transaction. In this case, what is the total
expected number of times that the falke bills are successfully used in transactions without being detected?
Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on-
Suggestion: Start by writing expressions for the expected number of undetected transactions in week 1,
week 2, week 3, week 4, etc. and think about ways to write all or part of this as a series.
(d)
using it right away at the beginning of week 1. If we wanted the total expected number of transactions with
the 1,000 fake bills to be at most 1,700 then what percentage would we need to detect at each transaction?
Write your final answer as a percentage, and round to 2 decimal points.
Suppose now that instead of using a new detection tool starting in week 3, suppose we started
Transcribed Image Text:1. Suppose that a group of illegal counterfeiters print 1,000 copies of fake $20 bills and introduces them into the economy. Suppose that each bill is used once per week (starting in week 1), and that each time a bill is used, it has a 1 in 5 chance of being detected as fake. If it is detected, it is removed. If not, it is used again. (a) What does the expression 1000 (O" * ) represent? Explain. n=1 Suggestion: If you are unsure, try writing out the expression for n = 1,2, 3 and consider what these might represent. (Б) Find an expression of the form an that represents the total expected number of transactions n=1 where one of the fake bills are successfully used without being detected. Then determine if your series converges or diverges, and find its sum, if possible. (c) wards, each fake bill has a 1 in 3 chance of being detected at each transaction. In this case, what is the total expected number of times that the falke bills are successfully used in transactions without being detected? Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on- Suggestion: Start by writing expressions for the expected number of undetected transactions in week 1, week 2, week 3, week 4, etc. and think about ways to write all or part of this as a series. (d) using it right away at the beginning of week 1. If we wanted the total expected number of transactions with the 1,000 fake bills to be at most 1,700 then what percentage would we need to detect at each transaction? Write your final answer as a percentage, and round to 2 decimal points. Suppose now that instead of using a new detection tool starting in week 3, suppose we started
Expert Solution
steps

Step by step

Solved in 6 steps with 5 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,