Proof by exhaustion

（重定向自Brute force method）

Proof by exhaustion, also known as proof by cases, perfect induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases and each type of case is checked to see if the proposition in question holds. This is a method of direct proof. A proof by exhaustion contains two stages:

单词	Brute force method
释义	Brute force method 英语百科 Proof by exhaustion （重定向自Brute force method） Proof by exhaustion, also known as proof by cases, perfect induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases and each type of case is checked to see if the proposition in question holds. This is a method of direct proof. A proof by exhaustion contains two stages:
随便看	burnetts gin Burnett solution Burnett stresses Burnettsville Burnett syndrome Burnett theory burneux Burney Burney, Charles Burn,Eye Burney, Frances Burney, Mte. Burney needle holder burn fast burn fat burn fatality burn feet syndrome burn ... fingers burnfire burnfires Burnfoot burn for burn from burn from lime burn front