Recent content by AvgStudent
-
A
Is the function f(z) = |z|2 differentiable at z0 = a + bi?
f'(z0)=\stackrel{lim}{x\rightarrow0} \frac{f(z0-z)-f(z0)}{z} Hi, I'm attempting to use the above equation to show where z0 is not differentiable at some point z0 for the equation f(z) = |z|2 I was wondering how I could go about doing this? I tried letting z0 = a + bi, and z = x + yi...- AvgStudent
- Thread
- Complex Differentiable
- Replies: 1
- Forum: Calculus and Beyond Homework Help
-
A
Thermodynamics: Pouring Cream into Coffee
Nvm. I made mistakes ._. I don't know how to delete the post.- AvgStudent
- Post #2
- Forum: Introductory Physics Homework Help
-
A
Thermodynamics: Pouring Cream into Coffee
I did a general problem of the perfect time to pour cream into coffee. I was hoping someone could check my work It's in the pdf below: docs(dot)google(dot)com/open?id=0Bx8zdkF5WYAbMl80UjI5U2lmdlU Thanks- AvgStudent
- Thread
- Coffee Thermodynamics
- Replies: 1
- Forum: Introductory Physics Homework Help
-
A
Minimal Fencing for Building a Rectangular Chicken Coop
Ooh. I didn't catch that. Is there a possible way to create a formula to find x and y relating to N? No matter how I think about it, it doesn't apply to all N.- AvgStudent
- Post #5
- Forum: Calculus and Beyond Homework Help
-
A
Minimal Fencing for Building a Rectangular Chicken Coop
I'm sorry, I don't exactly understand your answer. How would that minimize the perimeter? And in the problem it says you have to be as close to, but not more than N.- AvgStudent
- Post #3
- Forum: Calculus and Beyond Homework Help
-
A
Minimal Fencing for Building a Rectangular Chicken Coop
A farmer wishes to build a rectangular chicken coop with as close to, but not greater than N square units. He wants to purchase the least amount of fencing possible, but fencing can only be purchase by the integer foot. How does he do this? P = 2x+2y N = xy y=N/x P = 2x + 2(N/x) P' =...- AvgStudent
- Thread
- Optimization
- Replies: 4
- Forum: Calculus and Beyond Homework Help
-
A
Graduate Combinatorial Proof of a Recurrence Relation
So my professor gave us this recurrence relation to prove combinatorially for extra credit, but I was unable to figure it out. h(n) = 5h(n-1) - 6h(n-2) + 1 This was my solution, but I couldn't figure out how to factor in the +1: Let hn be the number of ways to arrange 0,1,2,3,4 on a 1xn...- AvgStudent
- Thread
- Proof Recurrence Relation
- Replies: 1
- Forum: Set Theory, Logic, Probability, Statistics