3:56 PM // November 6, 2015 | Calculus has yet again stolen another Friday away from me. I’ll reward myself with a visit to Lush once I complete all this homework and studying for my exam.

(Keep it up guys! Don’t quite give up yet just because it’s almost the end of the semester!)

antiderivatively replied to your post: i really wanna collab or something with someone…

do one with me.

*u* dude we could just do it every lunch bahaha

but yeah we both know who’s doin lines

 lupelie replied to your posti really wanna collab or something with someone…

shoot 4 the moon even if you dont make it you will die dont even worry



 gruvvulousglove replied to your posti really wanna collab or something with someone…

lets do one toghether„„,even if im really awful at everything and youre great„„,

omG NO WAIT I WAS GONNA REDO THAT JOHNDAVE THING THAT I DID AT THE MEETUP AFTER THE BONUS ROUND WAS FINISHED I guess i should start that now but yeah aside wat u wanna draw,,

 bronzepaw replied to your posti really wanna collab or something with someone…

Ill do one ;a;

/u\ sure what u wanna do


Algebraic Combinatorics. Combinatorics is the systematic study of counting structured collections objects. Algebraic combinatorics is doing this, but with a special emphasis on using notions of symmetry and linearity to help with the counting process. A technique that is often indicative of algebraic combinatorics (although by no means exclusive to this field) is to use lists of numbers called “generating functions” as a way of solving many similar counting problems simultaneously. Remarkably, it is often easier to proceed in this way than to focus attention on a single problem!

Students of calculus may recognize this theorem as the dreaded “partial fraction decomposition”. This trick can be used to make tedious calculus problems, but it has a less unseemly application: the most serious step in the proof that all rational functions have elementary antiderivatives.