User contributions
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 21:13, 22 September 2010 (diff | hist) User:RickettsAM
- 19:15, 16 February 2009 (diff | hist) Talk:Main Page
- 22:27, 13 November 2008 (diff | hist) User:RickettsAM
- 22:26, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 20:00, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 20:00, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:20, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:19, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:12, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:10, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:10, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:03, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 19:00, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 18:55, 13 November 2008 (diff | hist) ProofWiki:Sandbox
- 16:43, 2 November 2008 (diff | hist) ProofWiki:News
- 16:08, 2 November 2008 (diff | hist) ProofWiki:News
- 17:17, 26 October 2008 (diff | hist) N Product Rule For Counting (New page: ==Theorem== Suppose a process can be broken into <math>m</math> successive, ordered, stages, with the <math>i^{\text{th}}</math> stage having <math>r_i</math> possible outcomes (for <math...)
- 17:03, 26 October 2008 (diff | hist) m Sum Rule for Counting
- 17:02, 26 October 2008 (diff | hist) N Sum Rule for Counting (New page: ==Theorem== If there are <math>r_1</math> different objects in the Definition:set <math>O_1</math>, <math>r_2</math> different objects in the set <math>O_2</math>, <math>\ldots</math...)
- 13:42, 22 October 2008 (diff | hist) Talk:Recurrence Relation for the Number of Derangements on a Finite Set
- 13:40, 22 October 2008 (diff | hist) Recurrence Relation for the Number of Derangements on a Finite Set
- 13:26, 22 October 2008 (diff | hist) Talk:Recurrence Relation for the Number of Derangements on a Finite Set
- 12:45, 22 October 2008 (diff | hist) Recurrence Relation for the Number of Derangements on a Finite Set
- 12:42, 22 October 2008 (diff | hist) Talk:Recurrence Relation for the Number of Derangements on a Finite Set
- 12:02, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set
- 11:35, 22 October 2008 (diff | hist) m User:RickettsAM
- 11:34, 22 October 2008 (diff | hist) N Talk:Recurrence Relation for the Number of Derangements on a Finite Set (New page: ==Is the notation clear?== I'd never proven this relation using this much function or set notation before. Is it clear enough? --~~~~)
- 11:32, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set (Added the proofread template)
- 11:30, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set (→Case 2 f(1) = s)
- 11:30, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set (→Case 1 f(1) \neq s)
- 11:21, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set (Recurrence Relation for Derangements moved to Recurrence Relation for the Number of Derangements on a Finite Set: Former title wasn't as clear as it could be.)
- 11:18, 22 October 2008 (diff | hist) m Cardinality of Set of Injections
- 11:13, 22 October 2008 (diff | hist) N Category:Counting Arguments (New page: Category:Proofs)
- 11:13, 22 October 2008 (diff | hist) m Recurrence Relation for the Number of Derangements on a Finite Set (added categories)
- 11:11, 22 October 2008 (diff | hist) N Recurrence Relation for the Number of Derangements on a Finite Set (New page: ==Theorem== The number of derangements of a Definition:finite Definition:set <math>S</math> where <math>|S|=n+1</math> is <math>D_{n+1} = n(D_n+D_{n-1...)
- 10:45, 22 October 2008 (diff | hist) Definition:Derangement
- 10:25, 22 October 2008 (diff | hist) m Definition:Derangement ((added notation for finite derangements))
- 10:15, 22 October 2008 (diff | hist) Definition:Derangement
- 10:11, 22 October 2008 (diff | hist) N Definition:Derangement (New page: A ''derangement'' is a Definition:permutation <math>f: S \to S</math> from a set <math>S</math> to itself where <math>f(s)\neq s</math> for any <math>s\in S</math>.)
- 20:34, 8 October 2008 (diff | hist) User:Joe
- 09:18, 5 October 2008 (diff | hist) L'Hôpital's Rule
- 09:16, 5 October 2008 (diff | hist) Talk:L'Hôpital's Rule
- 10:02, 17 September 2008 (diff | hist) Talk:Main Page
- 07:44, 26 August 2008 (diff | hist) ProofWiki:News
- 16:20, 19 August 2008 (diff | hist) Talk:Main Page (→A question about categories)
- 12:13, 14 August 2008 (diff | hist) ProofWiki:Wanted proofs list
- 12:11, 14 August 2008 (diff | hist) ProofWiki:Wanted proofs list
- 11:15, 14 August 2008 (diff | hist) ProofWiki:News
- 10:14, 14 August 2008 (diff | hist) ProofWiki:Community Portal
- 09:55, 14 August 2008 (diff | hist) m Equal Set Differences iff Equal Intersections (→Proof)
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
