Dataset1/D1T1S4n

From Jsarmi

< Dataset1
Revision as of 13:20, 24 May 2007 by Jsarmi (Talk | contribs)
(diff) ←Older revision | view current revision (diff) | Newer revision→ (diff)

Team 1, Session 4: Notes

Other teams

54  ModeratorSf, 20:07 (19.05): We are ready to start. Today, you can finish the work that you have been doing as a team 
                                in the previous three sessions. There are five teams in this project and they have all explored very 
                                interesting questions about the ?grid-world? that we started with.

We came to a solution for the one last time

69  ModeratorSf, 20:14 (19.05): you can continue the problems from last time or we can try another, what you say?               
70  mathpudding, 20:16 (19.05): try another          
71  TinyFryhiii12, 20:15 (19.05): another     
72  mathman, 20:16 (19.05): another we came to a solution for the one last time
    ModeratorSf 5/19/05 8:15:34 PM EDT: ok
    ModeratorSf 5/19/05 8:16:01 PM EDT: i'll put it on the whiteboard
 
 Textbox on the whiteboard:
 Here is a problem to work today or, why not, with your friends this summer: 
 You might wonder what you get if you find all of the points that are the same distance 
 from a given point and then connect them (with the shortest path). In regular geometry 
 this would give you a circle. What would you get here? What would be the ratio of circumference 
 to the diameter? In regular geometry it is always the same number, pi.
 ModeratorSf 5/19/05 8:20:05 PM EDT: so, you see that, in some way there is a link to the previous problems...
 mathman 5/19/05 8:20:21 PM EDT: yes
Personal tools