Hey folks,(adsbygoogle = window.adsbygoogle || []).push({});

This isn't a homework problem (I finished school years ago) so please don't move this.

Here is my problem:

I have:

ncities

xmailmen where each mailman delivers tokcities where k<n and selected at random.

Here is an example:

Lets say I have 250 cities (named according to there number). Mailman 1 drives between city 86 to city 211 (as that happens to be his route), and then goes on from city 211 (as he is already there) to city 16. These routes are selected completely randomly.

So, how many mailmen would I need so that ALL cities were connected by a mailman to all other cities.

Help request: You don't need to answer this for me, I just need guidance as to what sort of formula/stats is used for this. I have advanced math skills, but stats is very much lacking.

Any sort of guidance here is very much appreciated!

Spock

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Mail man problem

Loading...

Similar Threads - Mail problem | Date |
---|---|

B Problem in Counting - Number of Passwords | Feb 23, 2018 |

I A specific combination problem | Feb 6, 2018 |

I A seemingly simple problem about probability | Jan 29, 2018 |

I Extension of Turing computable | Nov 14, 2017 |

**Physics Forums - The Fusion of Science and Community**