Challenge problems - Revision history

Ryan Moruzzi at 01:23, 3 May 2015

2015-05-03T01:23:07Z

Ryan Moruzzi at 01:08, 3 May 2015

2015-05-03T01:08:42Z

Ryan Moruzzi at 01:08, 3 May 2015

2015-05-03T01:08:11Z

Ryan Moruzzi at 01:06, 3 May 2015

2015-05-03T01:06:05Z

Ryan Moruzzi: /* Problem 2 */

2015-05-03T00:50:44Z

Problem 2

Ryan Moruzzi at 17:37, 2 May 2015

2015-05-02T17:37:01Z

Ryan Moruzzi at 17:34, 2 May 2015

2015-05-02T17:34:07Z

Ryan Moruzzi at 17:20, 2 May 2015

2015-05-02T17:20:29Z

Ryan Moruzzi: /* Problem 1 */

2015-05-02T17:14:42Z

Problem 1

Ryan Moruzzi: /* Challenge Problems */

2015-04-02T20:12:07Z

Challenge Problems

@@ Line 6: / Line 6: @@
 What is the minimum number of times the lights must be turned off so that everyone will have left the room?
 |}
@@ Line 17: / Line 18: @@
-==Problem 3 ==

@@ Line 15: / Line 15: @@
 [[Challenge Problem 2 Solution]]
 |}
 ==Problem 3 ==

@@ Line 7: / Line 7: @@
 |}
-One hundred mathematicians are invited to the castle of Dr. Evil for an evil math convention.  Before entering the ballroom, he gives each mathematician a hat with 7 accurate digits of pi on the front.  No one sees their own hat but they are all told that at least one person has 7 accurate digits of pi on their hat.  Next, Dr. Evil tells them to walk into the ballroom and stand in a circle so they can see every other mathematician.  He tells them the lights in the ballroom will be continuously turned off then back on and as soon as you figure out if your hat as the accurate digits of pi on the front, you must leave the room when the light is turned off.
+{| class="mw-collapsible mw-collapsed" style = "text-align:left;"
 ==Problem 2 ==
 Four cats are sitting at the four corners of a square.  Each cat randomly picks a direction and starts to move along the edge of the square. What is the probability that none of the cats collide?
 --------------------------------------------------------------------------------------------------------------------------------------------
 ==Problem 3 ==

← Older revision		Revision as of 01:06, 3 May 2015
Line 1:		Line 1:
		+	{\| class="mw-collapsible mw-collapsed" style = "text-align:left;"
		+
		+	! Problem 1
		+	\|- The code in this line generates a new row. You can modify the text of the row by using html code.
		+	\|One hundred mathematicians are invited to the castle of Dr. Evil for an evil math convention. Before entering the ballroom, he gives each mathematician a hat with 7 accurate digits of pi on the front. No one sees their own hat but they are all told that at least one person has 7 accurate digits of pi on their hat. Next, Dr. Evil tells them to walk into the ballroom and stand in a circle so they can see every other mathematician. He tells them the lights in the ballroom will be continuously turned off then back on and as soon as you figure out if your hat as the accurate digits of pi on the front, you must leave the room when the light is turned off.
		+	What is the minimum number of times the lights must be turned off so that everyone will have left the room?
		+	\|}
		+
	==Problem 1==		==Problem 1==

@@ Line 9: / Line 9: @@
 ==Problem 2 ==
-Four cats are sitting at the four corners of a square.  Each cat randomly picks a direction and starts to move along the edge of the square.
+Four cats are sitting at the four corners of a square.  Each cat randomly picks a direction and starts to move along the edge of the square. What is the probability that none of the cats collide?
 [[Challenge Problem 2 Solution]]
 --------------------------------------------------------------------------------------------------------------------------------------------
 ==Problem 3 ==

@@ Line 13: / Line 13: @@
 What is the probability that none of the cats collide?
-[[Answer]]
+[[Challenge Problem Solutions]]
 --------------------------------------------------------------------------------------------------------------------------------------------
 ==Problem 3 ==

← Older revision		Revision as of 17:14, 2 May 2015
Line 2:		Line 2:

	One hundred mathematicians are invited to the castle of Dr. Evil for an evil math convention. Before entering the ballroom, he gives each mathematician a hat with 7 accurate digits of pi on the front. No one sees their own hat but they are all told that at least one person has 7 accurate digits of pi on their hat. Next, Dr. Evil tells them to walk into the ballroom and stand in a circle so they can see every other mathematician. He tells them the lights in the ballroom will be continuously turned off then back on and as soon as you figure out if your hat as the accurate digits of pi on the front, you must leave the room when the light is turned off.		One hundred mathematicians are invited to the castle of Dr. Evil for an evil math convention. Before entering the ballroom, he gives each mathematician a hat with 7 accurate digits of pi on the front. No one sees their own hat but they are all told that at least one person has 7 accurate digits of pi on their hat. Next, Dr. Evil tells them to walk into the ballroom and stand in a circle so they can see every other mathematician. He tells them the lights in the ballroom will be continuously turned off then back on and as soon as you figure out if your hat as the accurate digits of pi on the front, you must leave the room when the light is turned off.
		+

	What is the minimum number of times the lights must be turned off so that everyone will have left the room?		What is the minimum number of times the lights must be turned off so that everyone will have left the room?
		+	--------------------------------------------------------------------------------------------------------------------------------------------
		+
		+	==Problem 2 ==
		+
		+	Four cats are sitting at the four corners of a square. Each cat randomly picks a direction and starts to move along the edge of the square.
		+
		+
		+	What is the probability that none of the cats collide?
		+	--------------------------------------------------------------------------------------------------------------------------------------------
		+
		+	==Problem 3 ==

← Older revision		Revision as of 20:12, 2 April 2015
Line 1:		Line 1:
−	~~=Challenge Problems=~~
	==Problem 1==		==Problem 1==