Haile
Reputation
Next privilege 250 Rep.
 Dec 4 comment Using induction to show a greedy algorithm always makes the optimal task selection @dtldarek I think he's referring to the Activity Selection Problem Dec 2 comment Singly Connected Graphs Please add some punctuation to your question.. it's almost completely incomprehensible. Dec 1 comment Is there an iterative formula for the function $d(n)$? @LoersAntario do you need to compute d(n) for a single n? Or for all n < K, K fixed? Jul 9 comment Two different characterization of “differentiable function” I appreciate your answer, but I'm not able to understand it completely. The course was a lightweight introdution to 2-variables calculus for CompSci undegrads; and the teacher followed a quite relaxed approach mostly based on ideas from one-variable calculus. I probably should have written that in my question.. Jul 9 comment Two different characterization of “differentiable function” Ok, now things seems to be a little more clear! I'll focus on the definition with the limit and the geometric interpretation of that. Thanks for your answer. Feb 22 comment Normal subgroup of prime order is characteristic Clear! Thank you. Feb 22 comment Normal subgroup of prime order is characteristic Hi, the question is quite early in the book and the few things I know are: Definitions and Examples of Groups \ Subgroups \ Lagrange's Theorem \ Homomorphisms and Normal Subgroups. I understand that it might be difficult to prove that using only basic facts.. Herstein seems to love this kind of question