In a group of friends, each two people have exactly five common acquaintances. Prove that the number of pairs of friends is divisible by 3.
Airlines connect pairs of cities. How can you connect 50 cities with the fewest number of airlines so that from every city you can get to any other city by taking at most two flights?