benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / This question is unrelated to the graph shown in part a; instead, we consider a…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

This question is unrelated to the graph shown in part a; instead, we consider a general graph of many nodes and edges. Suppose that the carrier just picked up an order (we call it the original order) and will travel through the edges e_{1}, e_{2}, \ldots, e_{m} in the graph to deliver this original order. When s/he travels through an edge e, s/he may pick up a new order for the same destination from a merchant located somewhere on this edge, at probability P_{e} \in [0,1]. Such probabilities corresponding to the edges e_{1}, e_{2}, \ldots, e_{m} are P_{1}, P_{2}, \ldots, P_{m}. We ignore the probability of two or more such new pickups on each edge e as they tend to be very small. What is the expected number of new order(s) for the same destination that this carrier can pick up over the given route (disregarding the trunk capacity)? What is the probability that s/he picks up at least one new order for the same destination over the given route?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
00402537-3170-5d15-b937-9fbbc1cc50b5
task_key
test--00402537-3170-5d15-b937-9fbbc1cc50b5
task_revision_id
1
config / split
/ test

Official source

initial import