perplexus.info :: Probability : Mark's itinerary

Mark's itinerary (Posted on 2016-05-26)

A certain salesman, called Mark O.V. delivers his goods to three cities: C1, C2, & C3, staying only for one day at a time in each of them.
His stay in C1 is always followed by going next to C2. If he delivers in either C2 or C3 he is thrice as likely to continue to C1, than to the other city.

Provide your estimate of the number of working days in each of the cities
within a period of 12,000 working days.

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re(2): An	Jer	2016-05-29 21:05:33
re: An	Charlie	2016-05-29 14:06:54
An "I've not learned of Mr. O.V." Solution	Jer	2016-05-28 22:19:25
att: all solvers	Ady TZIDON	2016-05-28 16:23:35
Analytic + Simulation + Probabilistic	Charlie	2016-05-26 14:22:24

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info