Spider's Web: a solution
- POLYGON ROBOT FACTORY. Boswell, Laurie // Scholastic Math;03/19/2001, Vol. 21 Issue 11, p12
Provides tips in finding the missing angles in polygons and presents several mathematical problems about polygons.
- Ponder this! Yevdokimov, Oleksiy // Australian Senior Mathematics Journal;2010, Vol. 24 Issue 1, p64
A quiz concerning mathematics is presented.
- Untitled. Barton, Lyndon // Mathematical Spectrum;2014/2015, Vol. 47 Issue 1, p24
No abstract available.
- MATH salutes...Women's History Month. Lovett, William // Scholastic Math;03/22/99, Vol. 19 Issue 11, p8
Presents a math exercise which deals with polygons and women mathematicians, scientists and inventors.
- Two men with a problem. Stephenson, Paul // Mathematics Teaching;May2011, Issue 222, p18
The article presents mathematical problems related to indivisible numbers and the Spider's Web theorem which states that a polygon is regular if the equal sides of a convex polygon subtend equal angles at a chosen vertex.
- Thompsonâ€“Wielandt-Like Theorems Revisited. Van Bon, John // Bulletin of the London Mathematical Society;Feb2003, Vol. 35 Issue 1, p30
This paper provides a unified and elementary proof of four Thompsonâ€“Wielandt-like theorems.
- Variations of the tiling problem. AKIYAMA, JIN; NAKAMURA, GISAKU // Teaching Mathematics & its Applications;Mar2000, Vol. 19 Issue 1, p8
The usual tiling problem determines which polygons can be used to cover the plane exactly without overlaps or gaps. We consider two variations of that problem. The first attempts to determine polygons that can tile the plane by reflections as in a kaleidoscope. The second determines polygons...
- Magic Domino Squares -- 6. Zulauf, A.; Stokes, B. // New Zealand Mathematics Magazine;Aug2008, Vol. 45 Issue 2, p32
The article discusses several mathematical problems and solutions related to magic domino squares. One example provided focuses on finding a four by four domino square with a magic sum other than five. Other examples include finding magic domino squares having dimensions other than four by four,...
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. Halpern, Joseph Y.; Rêgo, Leandro Chaves // Journal of Logic & Computation;Aug2007, Vol. 17 Issue 4, p795
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the satisfiability problem for all logics between K and S4 is PSPACE-hard, while for S5 it is NP-complete. We show that it is...