Describe the difference between a weak form of proof by induction and a strong form of proof by induction.
weak = assume true for specific k, then prove also true for k+1; strong = assume true for all k < n, then show it's also true for k+1
T/F: Every theorem can be proved using a single correct proof technique. (In other words, if you can prove theorem X using proof by contraction, that's the only proof that will work for that theorem. Any other techniques won't work.)
False
True/False: Given any 3 two-dimensional vectors A, B, and C, it's always possible to find a linear combination of A and B that is equal to C.
False
Unlock this slideshow and over 4 million more with Baamboozle+