NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 2 results Save | Export
Peer reviewed Peer reviewed
Keeports, David – Mathematics Teacher, 1991
The four-color theorem stating that any map in a plane can be colored using no more than four colors represents a problem suitable for the liberal arts student. Presented is an algorithm for coloring familiar maps through the temporary removal of states bordering three or fewer states. (MDH)
Descriptors: Algorithms, College Mathematics, Enrichment Activities, Mathematical Enrichment
Peer reviewed Peer reviewed
Filimonov, Rossen; Kreith, Kurt – Journal of Computers in Mathematics and Science Teaching, 1992
Describes the Plane Geometry System computer software developed at the Educational Computer Systems laboratory in Sofia, Bulgaria. The system enables students to use the concept of "algorithm" to correspond to the process of "deductive proof" in the development of plane geometry. Provides an example of the software's capability…
Descriptors: Abstract Reasoning, Algorithms, Computer Assisted Instruction, Computer Software Development