Can You Prove It? Brain Teaser - 3 Houses & Utilities

  • Context: Undergrad 
  • Thread starter Thread starter BigStelly
  • Start date Start date
  • Tags Tags
    Brain
Click For Summary
SUMMARY

The brain teaser involving three houses needing connections to electrical, telephone, and gas utilities is proven impossible due to the constraints of planar graphs. The discussion references Euler's theorem, which states that for a planar graph with n vertices, m edges, and r regions, the equation n - m + r = 2 must hold. This theorem confirms that it is not feasible to connect all three houses to the utilities without crossing lines. A resource for further exploration is provided at the Math Forum website.

PREREQUISITES
  • Understanding of planar graphs
  • Familiarity with Euler's theorem
  • Basic graph theory concepts
  • Knowledge of mathematical proof techniques
NEXT STEPS
  • Study Euler's theorem in depth
  • Explore planar graph properties and applications
  • Investigate graph theory proof techniques
  • Review related problems in combinatorial mathematics
USEFUL FOR

Mathematicians, students of graph theory, educators teaching combinatorial concepts, and puzzle enthusiasts interested in mathematical proofs.

BigStelly
Messages
37
Reaction score
0
Here is another brain Teaser...


in 2D not 3D assume crossing lines disrupts the electric field,

3 houses need to be hooked up to electrical, telephone and gas. Is it possible to hook every house up to every building without crossing lines?

I know this is impossible but can anyone prove it, id be interested to see how.

Yeah some teacher once actually told me that same thing a few years ago in high school and i didnt believe them after trying about 500 times to solve the darn thing.
 
Mathematics news on Phys.org
Euler proved a beautiful theorem for polyhedra with the following analogon for graphs (The problem is a graph problem. You have to find a planar graph (i.e. a graph that can be drawn on a flat plane without the lines intersecting).

If you have a planar graph with n>0 vertices, m lines (branches, edges) and r regions (including the outer region), then: n-m+r=2

You can use this to prove the problem has no solution.

I found a site about it:
http://mathforum.org/dr.math/faq/faq.3utilities.html
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 10 ·
Replies
10
Views
11K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
3K
  • · Replies 16 ·
Replies
16
Views
6K