1. PF Contest - Win "Conquering the Physics GRE" book! Click Here to Enter
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The postman problem

  1. Jan 13, 2010 #1
    Suppose there's a single terraced street that contains 19 houses. The postman notices that no 2 adjacent houses ever receive mail on the same day, and that no more than 2 adjacent houses don't receive mail on any day. What is the maximum number of days he can deliver before repeating the pattern?

    3. The attempt at a solution
    well, there are a maximum of 10 deliveries he can make, starting at house 1 then missing a house and delivering to house 3 etc. And he can make a minimum of 6 deliveries
    There is only 1 way to deliver to 10 houses, but after that my methods start to fall apart!! any one got any insight that can help?
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted

Similar Threads - postman problem Date
Integration problem using u substitution Yesterday at 1:02 PM
Maximum/minimum problem Saturday at 4:00 AM
Minimum/Maximum problem Thursday at 1:55 PM
Differential Equation Problem Wednesday at 11:59 PM