Search results
Jump to navigation
Jump to search
Page title matches
- 2 KB (548 words) - 21:20, 17 January 2008
- 1.1, [[Mathematical Proof/Introduction/Logical Reasoning|Logical Reasoning]]. {{Mathematical Proof/answers|1.1|Mathematical Proof/Introduction|Logical Reasoning}} ...3 KB (647 words) - 18:18, 10 April 2007
- {{Mathematical Proof/answers|1.2|Mathematical Proof/Introduction|Notation}} [[Category:Mathematical Proof]] ...709 bytes (132 words) - 08:36, 12 July 2006
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> ...ow that the logical conclusion is that ''P'' is also false. However, in a proof by contradiction, we assume that ''P'' is true and ''Q'' is false and arriv ...6 KB (1,065 words) - 08:37, 12 July 2006
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> The method of proof by contradiction is to assume that a statement is not true and then to show ...3 KB (554 words) - 00:33, 2 May 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> The first example of a proof by induction is always 'the sum of the first n terms:' ...6 KB (1,040 words) - 19:20, 9 May 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> A constructive proof is the most basic kind of proof there is. It is a proof that starts with a ''hypothesis'' and goes through a list of logical reason ...8 KB (1,490 words) - 06:54, 17 March 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> A proof by counterexample isn't technically a proof. It's merely a way of showing that a given statement cannot possibly be co ...3 KB (530 words) - 19:23, 9 May 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> ...will define a minimal amount of set-theoretical objects so the concept of mathematical thinking can be understood. In this book we will use capital letters for ...12 KB (2,194 words) - 01:44, 5 April 2007
- {{Mathematical Proof/navigation}} ...multiplication). [[Mathematical Proof/Methods of Proof/Constructive Proof|Proof by Contrapositive]] ...6 KB (925 words) - 03:52, 7 October 2006
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> ...or," "and," "if," "only if." (Here I would like to point out that in most mathematical papers it is acceptable to use the term "we" when referring to oneself. Th ...9 KB (1,556 words) - 08:14, 7 September 2007
- This is a list of all the mathematical symbols used in this book. <!--Use this template for symbol definitions {{Mathematical Proof/symbol||}}. The first argument is the symbol and the second is its definiti ...2 KB (355 words) - 03:22, 29 March 2007
- ==Proof== This is a proof by contradiction, so we assumes that <math> \sqrt{2} \in \mathbb{Q} </math ...2 KB (324 words) - 08:04, 22 December 2007
Page text matches
- This is a list of all the mathematical symbols used in this book. <!--Use this template for symbol definitions {{Mathematical Proof/symbol||}}. The first argument is the symbol and the second is its definiti ...2 KB (355 words) - 03:22, 29 March 2007
- {{Mathematical Proof/answers|1.2|Mathematical Proof/Introduction|Notation}} [[Category:Mathematical Proof]] ...709 bytes (132 words) - 08:36, 12 July 2006
- {{Mathematical Proof/navigation}} ...multiplication). [[Mathematical Proof/Methods of Proof/Constructive Proof|Proof by Contrapositive]] ...6 KB (925 words) - 03:52, 7 October 2006
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> The method of proof by contradiction is to assume that a statement is not true and then to show ...3 KB (554 words) - 00:33, 2 May 2007
- 1.1, [[Mathematical Proof/Introduction/Logical Reasoning|Logical Reasoning]]. {{Mathematical Proof/answers|1.1|Mathematical Proof/Introduction|Logical Reasoning}} ...3 KB (647 words) - 18:18, 10 April 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> A proof by counterexample isn't technically a proof. It's merely a way of showing that a given statement cannot possibly be co ...3 KB (530 words) - 19:23, 9 May 2007
- =Introduction to Mathematical Proof= ...356 bytes (51 words) - 12:52, 9 January 2008
- ==Proof== This is a proof by contradiction, so we assumes that <math> \sqrt{2} \in \mathbb{Q} </math ...2 KB (324 words) - 08:04, 22 December 2007
- Proof of the above statement: ...he Laplace-Beltrami operator, when acting on a scalar function ''f''. This proof reads as: ...3 KB (537 words) - 01:15, 9 November 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> ...ow that the logical conclusion is that ''P'' is also false. However, in a proof by contradiction, we assume that ''P'' is true and ''Q'' is false and arriv ...6 KB (1,065 words) - 08:37, 12 July 2006
- Induction is a form of proof useful for proving equations involving non-closed expressions (i.e, express ...n proving true for <math>n = k + 1</math> (assuming for the purpose of the proof that the equation holds true for <math>n = k</math>). Since it is true for ...2 KB (266 words) - 23:23, 24 October 2007
- :''Proof'': Consider a neighborhood N = <math>N_r(p)</math>. Now if q <math>\in</mat :''Proof'': Suppose there is a neighborhood N of p which contains only a finite numb ...4 KB (787 words) - 01:17, 9 November 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> A constructive proof is the most basic kind of proof there is. It is a proof that starts with a ''hypothesis'' and goes through a list of logical reason ...8 KB (1,490 words) - 06:54, 17 March 2007
- ''Proof'': [[Category:The Book of Mathematical Proofs]] ...1 KB (202 words) - 08:27, 3 January 2008
- == Proof == == Problems with the proof == ...6 KB (980 words) - 01:47, 20 December 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> The first example of a proof by induction is always 'the sum of the first n terms:' ...6 KB (1,040 words) - 19:20, 9 May 2007
- ''Proof'': * Properties 2 and 3 can be extended by the principle of mathematical induction to any finite set. That is, <math> a_1 | a_2</math>, <math> a_2 | ...7 KB (1,201 words) - 18:36, 2 February 2008
- ====Example of a Two-Column Proof==== .../math> for <math>x</math>, showing all steps made to get to the answer. A proof shows how this is done: ...7 KB (1,162 words) - 19:37, 9 January 2008
- :''Proof'': Clearly the sum of two m×n matrices is another m×n matrix. If A and B ar :''Proof'': Start with the left hand side of (1). We will work with the (i,j)th entr ...5 KB (956 words) - 01:07, 9 November 2007
- <noinclude>{{Mathematical Proof/navigation}}</noinclude> ...or," "and," "if," "only if." (Here I would like to point out that in most mathematical papers it is acceptable to use the term "we" when referring to oneself. Th ...9 KB (1,556 words) - 08:14, 7 September 2007