Suppose there are n cities that are to be connected with telephone wires. Apply
Chapter 12, Problem 29(choose chapter or problem)
Suppose there are n cities that are to be connected with telephone wires. Apply mathematical induction to prove that the number of telephone wires required to connect the n cities is given by Assume each city has to connect directly with any other city.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer