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. n-1 (a) What does the expression E 1000 ()"* (1) 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. (b) Find an expression of the form E 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. Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on- (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 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.

MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
icon
Related questions
Question
Problems:
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.
п-1
(a)
What does the expression E 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.
(b)
Find an expression of the form E 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.
Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on-
(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 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.
(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:Problems: 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. п-1 (a) What does the expression E 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. (b) Find an expression of the form E 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. Suppose that a new detection tool is introduced starting in week 3 and that from week 3 on- (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 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. (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 3 steps

Blurred answer
Recommended textbooks for you
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman