AkshajK's blog

Most Beautiful Combinatorics Problem I've Ever Seen
By AkshajK, history, 4 days ago, In English

Hey! Wanted to share a beautiful combinatorics problem — the best short-answer problem I've seen recently. Try it when you have 15 minutes to spare since your submission will be timed :)

Beautiful Combinatorics Problem

Hope you all enjoy! There is a solution on the 'post-contest' screen.

  • Vote: I like it
  • +7
  • Vote: I do not like it

»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Hmmm, not suspicious at all...

→ Reply
  • »
    »
    4 days ago, # ^ |
      Vote: I like it -19 Vote: I do not like it

    I added it onto the site as a contest because of how beautiful it was haha

    → Reply
»
4 days ago, # |
  Vote: I like it +18 Vote: I do not like it

348D - Turtles

More generally, see the LGV Lemma

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Yep, it's very nice

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

It is pretty cool. It reminds me of another one I saw that went like this:

You are an archer and you have to pop three columns of balloons. One column contains $$$2$$$ balloons and the other two columns contain $$$3$$$ balloons. You can pop a balloon from any column, but unfortunately, you can only pop the bottommost balloon in some column. In how many different ways can you pop all the balloons?

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

mine is this

→ Reply