Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (mathmath333):

Counting question

OpenStudy (mathmath333):

There are \(12\) towns grouped into \(4\)-zones with \(3\) towns per zone. It is intended to connect the towns with telephone lines such that every \(2\) towns are connected with \(3\) direct lines if they belong to the same zone, and with only \(1\) direct line otherwise. How many direct telephone lines are required?

Parth (parthkohli):

Nothing much to think about here. Consider one zone. If we look at the lines within that zone, there are \(3\cdot \binom{3}{2}\) lines since there are 3 lines per two towns. Thus, overall, there are \(3\cdot 3 \cdot \binom{3}{2}\) lines that connect towns in the same zone. Now let's look at towns that don't belong to the same zone. For every town, there are six towns that do not belong to the same zone as that particular town, and thus, we find the number of towns and multiply that by 6 to find the lines that connect towns NOT belonging to the same zone.

Parth (parthkohli):

Not six towns - I meant nine.

OpenStudy (mathmath333):

well i m yet to study probablity, is there any alternate way

Parth (parthkohli):

Also that should be \(4\cdot 3 \cdot \binom{3}2\)

Parth (parthkohli):

|dw:1434886089734:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!