Happy Halloween. The following link should contain some math related Halloween comics from the past: Spiked Math Halloween Comics

Happy Halloween. The following link should contain some math related Halloween comics from the past: Spiked Math Halloween Comics

# Google+ Page // Facebook Page // Twitter Page

## 9 Comments

## Leave a comment

Profile pictures are tied to your email address and can
be set up at Gravatar.
Click here for recent comments.

(Note: You must have

If you make a mistake or the comment doesn't show up properly, email me and I'll gladly fix it :-).

(Note: You must have

**javascript**enabled to leave comments, otherwise you will get a comment submission error.)If you make a mistake or the comment doesn't show up properly, email me and I'll gladly fix it :-).

# Google+ Page // Facebook Page // Twitter Page

New to Spiked Math?

View the top comics.

View the top comics.

**New Feature:**Browse the archives in quick view! Choose from a black, white or grey background.
First!!! Happy Halloween everyone!

Happy Halloween!

Happy Halloween!

Onto the theorem: I know it's from graph theory, though I forget what ec(Edge Connectivity?) and tw mean.

Happy Haloween!

I'm going as a generic avatar, bet you didn't recognize me

Wiki's always our best friend =p

http://en.wikipedia.org/wiki/BEST_theorem

ec = Eulerian Circuits, t_w is the number of arborescences at a fixed vertex w

Being halloween and all, I'm thinking this must have something to do with figuring out the most efficient way to canvass the neighborhood for candy, but I'm not seeing it...

it's about calculating how many paths you can take. assuming you get candy on edges, but if we assumed candy was on vertices haloween would be NP-complete.

still not sure why its the best theorem ever but this is the best Polar Plot[(1 + 0.9 Cos[8 t]) (1 + 0.1 Cos[24 t]) (0.9 + 0.05 Cos[200 t]) (1 + Sin[t]), {t, -Pi, Pi}]

Reminds me of the Alpha Beta Gamma paper...