The formula is n-1 if they dont criss-cross...But if they are straight roads
they may intersect once only..Say in the form of a triangle...Three roads
will will form three intersection...hence three lamps...And as the number of
roads increase so do the endless mathematical permutations and
combination...
lol. Just a guess...
On Sat, Oct 10, 2009 at 5:51 PM, Brian McMillan
<[log in to unmask]>wrote:
> Dear all,
>
> This is a slightly embarrassing question, but I've been trying to figure
> out
> if there is a formula that would answer this question;
>
> "In a village where all the roads are straight, every time two streets
> intersect a street lamp is required. Investigate the number of street lamps
> required for 2 streets, 3 streets, 4 streets, etc...
>
> What is the minimum and maximum number of lamps needed for 5 streets? n
> streets?"
>
> The minimum is obvious, it's just n-n because the streets may never
> intersect.
>
> But is there a mathematical formula for working out the maximum for any
> given number of streets?
>
> Thanks in advance,
> Brian
>
--
Regards
Dr. Bilal Mustafa Khan
Assistant Professor
Department of Business Administration
Aligarh Muslim University (AMU)
India
0091-9897310838
--
Regards
Dr. Bilal Mustafa Khan
Assistant Professor
Department of Business Administration
Aligarh Muslim University (AMU)
India
0091-9897310838
|