Блог пользователя giant_text

Автор giant_text, история, 4 года назад, По-английски

this method (discovered by me!!!) allows to become lgm, but red black trees are very difficult and no one really wants to study them
so I've discovered a new (!) method to become lgm, and it requires no effort (!!!)
now I'll prove that everyone is an lgm

lemma: everyone has the same rating on codeforces
proof by induction: we will prove that every group of $$$n$$$ people has the same rating on codeforces
base case: this is obviously true for $$$n = 1$$$
induction: $$$n \rightarrow n + 1$$$
pick a group of $$$n + 1$$$ people: the $$$n$$$ people on the left and also the $$$n$$$ people on the right have the same rating, so the property is true also for $$$n + 1$$$
so everyone has the same rating (q. e. d.)
so you have the same rating of tourist (!!!)
so you are an lgm (!!!!!)

  • Проголосовать: нравится
  • -34
  • Проголосовать: не нравится

»
4 года назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится

It also means we have the same rating as jh05013 but you're gonna ignore that part aren't you

»
4 года назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

Let's be honest: your induction fails in translation from 1 to 2)

»
4 года назад, # |
  Проголосовать: нравится +33 Проголосовать: не нравится

It sounds a lot like you've proven that all programmers are horses of the same color with an infinite number of legs!

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Delusions can affect mathematical induction too.

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

This post is one of those things I wouldn't be able to unsee.