Proof (geometry)
Jump to navigation
Jump to search
A proof in mathematical terms is something that which can be proven using another proof.
Formal Definition[edit]
Define the problematic set S such that all elements a_{i} are unsolved problems. Therefore, the method ξ(a_{i}) will return a solution that makes a_{i} no longer an element in the problematic set.
Famous Examples[edit]
- Proof: All bedrooms will tend towards an overall state of disorganization with efficiency lim n→∞ Θ(ln(n)):
- Define a bedroom Β_{0} as a teenage bedroom's initial state at time n = 0. Because of the Teenager Inefficiency Theorem,
- Β_{i} = (Β_{i-1} + Σ(ln(n)))/Β_{i-1}, n = 0, 1, 2, ..., i
- Therefore, disorganizedness Β_{i} will tend to infinity, but at an increasedly slower rate, mimicking a teenage bedroom that, once it has reached a threshold messiness, it is difficult for it to increase the messiness.
- So using the deMarconi Simplification Axiom by transposing Β_{i} into an algorithmical efficiency expression, one gets that which was meant to be proven.
Q.E.D.
This page has received the blessing of The Great Gozimnot of Mathematics, and is therefore mathematically correct in all aspects. |