WebQuest
Pythagorean Theorem
Finding routes within the city of Euclid
Step 1: Download the file of the City of Euclid map.
Step 2: Write down the coordinates for each location labeled on the map.
Step 3: Find the distance a car would have to travel between 2 locations.
- Choose 4 sets of locations. For example, City Hall to the Police Station.
- The distance will be measured in number of blocks.
- 1 block = the side of 1 square on the grid.
- Cars cannot travel through blocks, they must stay on the road.
- The road is the gridlines.
Save this paper for use during the review.
Attachments
File
-
File
Description: City of Euclid map.
The Public URL for this WebQuest:
http://zunal.com/webquest.php?w=82037
WebQuest Hits: 27,701
Save WebQuest as PDF
