New Canaan, CT
Sunday, January 27, 2013
10:00 am-4:00 pm
New Canaan Country School
~Presentations and discussions
~Exhibit hall showcasing local and national resources
~Interactive sessions and mini-courses for grades 3 and up
Visit the link below if you would like to attend.
http://www.scholarsearchassoc.com/media/com_acymailing/upload/fairfield_forum_poster.pdf
"If you can dream it, you can do it"
-Walt Disney
Thursday, December 20, 2012
Wednesday, December 19, 2012
Something to work on over the break:)
Let's see who can get it first!
Below you will find 9 well-known five letter words, with only their endings remaining. Once you have found the words, their initial letters can be anagrammed into a 9-letter word. What is the word?
Below you will find 9 well-known five letter words, with only their endings remaining. Once you have found the words, their initial letters can be anagrammed into a 9-letter word. What is the word?
Good Luck, and have a WONDERFUL break!..XIC
..IEN
..NRE
..PPO
..PIL
..LOO
..DAY
..UIP
..ELF
Monday, December 10, 2012
Brainteaser Alert!!!
Try out this classic brainteaser called The Towers of Hanoi.
The game called the Towers of Hanoi was invented by the French mathematician Edouard Lucas in 1883 and since then it has been both a popular puzzle and a well-known mathematical problem that is an excellent illustration of the general concept of recursion. This puzzle is known by most mathematicians and a very large number of people who like either puzzles or elementary mathematical problems. The problem is that you have to move the tower of wooden wooden circles - one at a time- from one post to another without placing a larger piece on a smaller piece. Sounds easy enough until you try it. Here is the link to play it online:
http://www.coolmath-games.com/towerofhanoi/index.html
Let us know what you think!!!
The game called the Towers of Hanoi was invented by the French mathematician Edouard Lucas in 1883 and since then it has been both a popular puzzle and a well-known mathematical problem that is an excellent illustration of the general concept of recursion. This puzzle is known by most mathematicians and a very large number of people who like either puzzles or elementary mathematical problems. The problem is that you have to move the tower of wooden wooden circles - one at a time- from one post to another without placing a larger piece on a smaller piece. Sounds easy enough until you try it. Here is the link to play it online:
http://www.coolmath-games.com/towerofhanoi/index.html
Let us know what you think!!!
Subscribe to:
Posts (Atom)