by zefuri » Fri Apr 20, 2007 9:16 pm
lol and i say clearly cuz im lazy =P
Well,
We assume that [unparseable or potentially dangerous latex formula] is a square for sake of contradiction.
Since [unparseable or potentially dangerous latex formula] is [unparseable or potentially dangerous latex formula] and all squares are [unparseable or potentially dangerous latex formula]
Because [unparseable or potentially dangerous latex formula], [unparseable or potentially dangerous latex formula] must be [unparseable or potentially dangerous latex formula] to be congreunt to 0 or 1 respectively.
Now, isnt clearly much easier