01:15:58 -!- lament has quit ("leaving").
05:06:56 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
05:07:08 -!- Taaus has joined.
07:22:15 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
07:22:21 -!- Taaus has joined.
07:43:44 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
07:44:08 -!- Taaus has joined.
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:04:12 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
08:04:37 -!- Taaus has joined.
11:36:40 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
11:36:46 -!- Taaus has joined.
12:19:20 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
12:19:44 -!- Taaus has joined.
13:32:07 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
13:32:19 -!- Taaus has joined.
15:29:04 -!- Taaus has quit (niven.freenode.net irc.freenode.net).
15:29:08 -!- Taaus has joined.
17:55:05 -!- lament has joined.
21:23:25 -!- lament has quit ("Lost terminal").
21:25:27 -!- lament has joined.
22:28:17 <lament> i proved the [l.count(x) == l[x] for x in range(len(l))] thing
22:28:38 <lament> Unfortunately this channel is too small for me to write it down.
22:34:21 <lament> I proved that there's only one solution for len(l) > 7
22:34:54 <Taaus> For every function?
22:35:20 <Taaus> That's wild, man.. I'd expect it to be for every len(l).
22:36:17 <lament> for every N there's only one l such as that len(l) == N and [l.count(x) == l[x] for x in range(N)]
22:38:39 <lament> (THIS is why i haven't written down the proof)
22:39:10 <Taaus> Because you find it difficult to express yourself in precise terms? :P
22:39:41 <lament> Math just isn't woozy enough.
22:43:30 <lament> Mathematicians can only think inside the box!