Salt Lake City looks like a rectangle crossed with M streets going from North to South and with N streets going from East to West. The city is frequented by tourists who are suppose to ride around in the busses. The Utah governor wants to controll all moves of the busses. He plans to put policemen at some intersections to watch all the busses moving on the streets visible from that intersections. What is the minimum number of policemen needed for the bus watch?
Welcome to BrainDen.com - Brain Teasers Forum
![]() |
Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-) |
City planning of tourists
Best Answer k-man, 03 March 2013 - 02:09 AM
#1
Posted 02 March 2013 - 11:39 PM
#2
Posted 03 March 2013 - 12:48 AM
#3
Posted 03 March 2013 - 02:09 AM Best Answer
#4
Posted 03 March 2013 - 04:59 AM
one policeman needs to see each horizontal and vertical street.
Edited by phil1882, 03 March 2013 - 05:00 AM.
#5
Posted 08 March 2013 - 03:55 AM
Spoiler for assuming that a policeman can see as far the street goes...
Does this ensure they can see all the busses, or just all the intersections?
- Bertrand Russell
#6
Posted 08 March 2013 - 04:17 PM
Spoiler for assuming that a policeman can see as far the street goes...
Does this ensure they can see all the busses, or just all the intersections?
#7
Posted 08 March 2013 - 04:25 PM
#8
Posted 08 March 2013 - 05:58 PM
I think this might be right.
Suppose M<N.
Then, keeping one policeman each at the junctions along the diagonal of a square of side M will take care of M number of streets.
And N-M policemen are required who can stand at any point on streets from east to west which does not belong to the M*M square.
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users






