Example: quiz answers
Proving Algorithm Correctness - Northeastern University

Proving Algorithm Correctness - Northeastern University

Back to document page

11.3.1 Proof by Counterexample De nition 11.1 (Proof by Counterexample) Used to prove statements false, or algorithms either in-correct or non-optimal Examples: Counterexample Prove or disprove: dx+ ye= dxe+ dye. { Proof by counterexample: x = 1 2 and y = 1 2 Prove or disprove: \Every positive integer is the sum of two squares of integers"

  Proof, Correctness, Counterexample

Download Proving Algorithm Correctness - Northeastern University


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries