Probabilistic method: Difference between revisions

Revision as of 19:52, 8 September 2020

Revision as of 02:28, 26 November 2020

Line 1:

{{short description|Nonconstructive method for mathematical proofs}}

The '''probabilistic method''' is a [[nonconstructive proof|nonconstructive]] method, primarily used in [[combinatorics]] and pioneered by [[Paul Erdős]], for proving the existence of a prescribed kind of mathematical object. It works by showing that if one randomly chooses objects from a specified class, the [[probability]] that the result is of the prescribed kind is strictly greater than zero. Although the proof uses probability, the final conclusion is determined for ''certain'', without any possible error.