Adlai | lol Olathe |

yossarian | actually, yeah, what |Steve| said |

godling | that's complex, right? |

Adlai | I think you're right it seems a little too intuitive though, I'd prefer to see a proof meh of course, it's also O(m!) |

|Steve| | Proof of what? |

Olathe | Proof that the algorithm is correct. |

Adlai | no, proof that m = n I'm pretty well convinced though |

|Steve| | It doesn't. |

Olathe | O-o |

|Steve| | The number of edges in a tree is one fewer than the number of nodes. |

Adlai | never mind, I'm just being stupid it doe s not after you add an edge |

juancgt | http://pastebin.ca/404580 can someone help? |

Olathe | % Limit[frobozz, dark->grue] |

mbot | Olathe: frobozz |

|Steve| | Tens: I already gave you the limit. |

Tens | Hold on there's no limit % Limit[(x+1)/(x^2+2x-3), x->1] |

mbot | Tens: Infinity |

|Steve| | Oh hey, it's not x-1. |

Tens | yeah Shit doesn't factor out Is that bot correct? |

Olathe | That bot is correct. |

Tens | I'm geting +/- infinity which yields no limit cause there's two different answers when approaching from the right or left. |

Piratero | hello... how exactly would if i find the vertical asymptote to say: p(x) = ln(x-2)+5? would i need to change the base from e to 10? |

SeveredCross | Oops. Got disconnected. <_> |

noway- | lol |

KEAL | it was the one ingredient for how to store a tiangle in threespace in 8 values and a limited number of ints |

noway- | it happens to all of us, we learn and don't make the mistake again |

SeveredCross | What? Are you just making shit up now? |