There are n parking spots 1, 2,..., n on a one-way street. Cars 1, 2,..., n arrive in this order. Each car i has a favorite parking spot f(i). When a car arrives, it first goes to its favorite spot. If the spot is free, the car will take it, if not, it goes to the next spot. Again, if that spot is free, the car will take it, if not, the car goes to the next spot. If a car had to leave even the last spot and did not find the space, then its parking attempt has been unsuccessful. If, at the end of this procedure, all cars have a parking spot, we say that f is a parking function on [n]. Prove that the number of parking functions on [n] is (n + 1)^n-1

Algebra: Structure And Method, Book 1
(REV)00th Edition
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Chapter4: Polynomials
Section4.1: Exponents
Problem 24OE
icon
Related questions
Question

Discrete MAthematics

There are n parking spots 1, 2, ..., n on a one-way street. Cars 1, 2, ..., n arrive in this order.
Each car i has a favorite parking spot f(i). When a car arrives, it first goes to its favorite spot. If
the spot is free, the car will take it, if not, it goes to the next spot. Again, if that spot is free, the
car will take it, if not, the car goes to the next spot. If a car had to leave even the last spot and
did not find the space, then its parking attempt has been unsuccessful. If, at the end of this
procedure, all cars have a parking spot, we say that f is a parking function on [n]. Prove that the
number of parking functions on [n] is (n + 1)^n-1
Transcribed Image Text:There are n parking spots 1, 2, ..., n on a one-way street. Cars 1, 2, ..., n arrive in this order. Each car i has a favorite parking spot f(i). When a car arrives, it first goes to its favorite spot. If the spot is free, the car will take it, if not, it goes to the next spot. Again, if that spot is free, the car will take it, if not, the car goes to the next spot. If a car had to leave even the last spot and did not find the space, then its parking attempt has been unsuccessful. If, at the end of this procedure, all cars have a parking spot, we say that f is a parking function on [n]. Prove that the number of parking functions on [n] is (n + 1)^n-1
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Elementary Linear Algebra (MindTap Course List)
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:
9781305658004
Author:
Ron Larson
Publisher:
Cengage Learning
Elementary Geometry For College Students, 7e
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage