User account "Rtabchou" is not registered.
- 04:15, 17 December 2008 (diff | hist) . . (+26) . . Jake's Christmas List MA375Fall2008walther (current)
- 08:45, 9 December 2008 (diff | hist) . . (+165) . . N 9.8 Problem 1 MA375Fall2008walther (New page: I found 4 colors. Given a color for A, we need two others for B and E, and since D is adjacent to A B E, we need a fourth. C can have the same color as E. --rtabchou)
- 11:20, 30 November 2008 (diff | hist) . . (+117) . . N 9.7 Problem 5 MA375Fall2008walther (New page: For the graph of exercise 2, I found a,b,e,d,z. Therefore the total weight is 7. It is the shortest path. --rtabchou)
- 17:04, 16 November 2008 (diff | hist) . . (+119) . . 9.5 Problem 22 MA375Fall2008walther
- 12:26, 9 November 2008 (diff | hist) . . (+86) . . N 9.3 Problem 40 MA375Fall2008walther (New page: The vertices don't have the same degrees. Therefore they are not isomorphic. -rtabchou)
- 12:25, 9 November 2008 (diff | hist) . . (+44) . . 9.3 Homework MA375Fall2008walther
- 12:24, 9 November 2008 (diff | hist) . . (+85) . . Main Page MA375Fall2008walther
- 17:27, 2 November 2008 (diff | hist) . . (+80) . . 9.2 Homework MA375Fall2008walther
- 05:13, 16 October 2008 (diff | hist) . . (+279) . . 7.1.24 MA375Fall2008walther
- 04:39, 9 October 2008 (diff | hist) . . (+327) . . N 6.2 Problem 26 MA375Fall2008walther (New page: P(E intersect F ) = number of strings starting with 1 and with an odd number of 1 / number of strings of lenght 3<br> P(E intersect F ) = 2 / 8 = 1 /4<p> P(E) = 4 / 8 = 1 / 2 ( 1 0 0...) (current)
- 05:02, 2 October 2008 (diff | hist) . . (+4) . . 6.1 Problem 14 MA375Fall2008walther (current)
- 05:02, 2 October 2008 (diff | hist) . . (+265) . . N 6.1 Problem 14 MA375Fall2008walther (New page: The number of ways to pick 5 cards of different kinds is 52*48*44*40*36/5! The number of ways to pick 5 cards is C(52,5) The probability is the number of ways to pick 5 cards of different...)
- 05:28, 25 September 2008 (diff | hist) . . (+225) . . N Rtabchou's Solution MA375Fall2008walther (New page: I just counted the possible ways of solving the problem.<br> Since the objects and the boxes are indistinguishables, the only possible ways are<br> 5 0 0 <br> 4 1 0<br> 3 2 0 <br> 3 1 1<br...) (current)
- 05:26, 25 September 2008 (diff | hist) . . (+46) . . 5.5 Problem 54 MA375Fall2008walther
