http://z5lcip2ba3ec6v5za5snjzncpvr6ocyvqnkox2alerut6ruozpjtvkqd.onion/math/catalog
Without looking up the answer, can you show with proof whether any n-sided polygon can be decomposed into n-2 triangles? Thread 102051 in /math/ P: 5, last 9 months ago BB(5) = 47,176,870 It has been proven that the longest-running 5-state 2-symbol Turing machine which halts is the one that halts in 47,176,870 steps.