Compras Nikon Bluetooth |
Proof techniques #1: Proof by Induction.
This technique is used on equations with "_n" in them. Induction
techniques are very popular, even the military used them.
SAMPLE: Proof of induction without proof of induction.
We know it's true for _n equal to 1. Now assume that it's true
for every natural number less than _n. _N is arbitrary, so we can take _n
as large as we want. If _n is sufficiently large, the case of _n+1 is
trivially equivalent, so the only important _n are _n less than _n. We
can take _n = _n (from above), so it's true for _n+1 because it's just
about _n.
QED. (QED translates from the Latin as "So what?")
It is only by risking our persons from one hour to another that we live
at all. And often enough our faith beforehand in an uncertified result
is the only thing that makes the result come true.
-- William James