Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
(Sourcery)
😪
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.
🤤
Make no little plans; they have no magic to stir men's blood.
-- Daniel Hudson Burnham
😲
Don't worry if you're a kleptomaniac; you can always take something for it.
😙
**_██_*。*. /★\ .˛* .˛.*.★* ° *★ Christmas*★ 。*
˛. (´• ̮•)*˛°.˛*/.♫.♫\*˛.* ˛_Π_____. * ˛* ♥2015♥ ˛* ˛*
.°( . • . ) ˛°./• '♫ ' •\.˛*./______/~\*. ˛*.。˛* ˛. *。
*(...'•'.. ) *˛╬╬╬╬╬˛°.|田田 |門|╬╬╬╬ . *. ˛*.。˛* ˛.*。
¯˜"*°••°*" ˜¯`´¯˜"*°••°*"˜¯` ´¯˜"*°´¯˜"*°••°*"˜¯`´¯˜"*°