Theorem: All positive integers are equal.
Proof: Sufficient to show that for any two positive integers, A and B, A = B.
Further, it is sufficient to show that for all N > 0, if A and B
(positive integers) satisfy (MAX(A, B) = N) then A = B.

Proceed by induction:
If N = 1, then A and B, being positive integers, must both be 1.
So A = B.

Assume that the theorem is true for some value k. Take A and B with
MAX(A, B) = k+1. Then MAX((A-1), (B-1)) = k. And hence
(A-1) = (B-1). Consequently, A = B.
🤓
In every non-trivial program there is at least one bug.
😭
Mulder: (smiling) The ENIGMATIC Dr. Scully!

"The X-Files: Fallen Angel"
🙂
If food is not reasonably clean, return uneaten portion for partial refund
😩
The light at the end of the tunnel is the headlight of an approaching train.
🤐
Please, won't somebody tell me what diddie-wa-diddie means?
😙

hacker

I trade my pudge arcana for any 10 Dota2 loading screens - if you want send me trade offer, I will accept

Hey bro, I can give my Manifold Paradox drow ranger arcana for all of your dota 2 loading screens (Im collecting them) so if it's ok for you send me trade offer please. Link in my bio

kleiner lappen der einfach nicht mehr ist als ein scheiss kanackenmäßiges hurenkind

crying aimbot schoolkid