Calculus-Optimization Problems

  • Thread starter Thread starter the_morbidus
  • Start date Start date
the_morbidus
Messages
18
Reaction score
0

Homework Statement


A study has determined that interactions at a large social party follow the mathematical progression N(t)=30t-t^2 , where t is the time in minutes since the party began, and N is the number of separate conversations occurring. At what time in a party do the most conversations occur? what is the maximum number of interactions?


Homework Equations


The Product Rule
F(x)=f(x)g(x) then F'(x)=f(x)g'(x)+f'(x)g(x)

The Chain Rule for Polynomials
F(x)=(f(x))^n,then F'(x)=nf'(x)f(x)^n-1


The Attempt at a Solution



So i decided to get the 1st derivative of N(t)=30t-t^2
N'(t)=30-2t
so now I'm trying to find t when the function equals 0.
0=30-2t
-30/-2=t
t=15 so this is the time since the party began.

now this is the part I'm not so sure of myself, i add the value of t to the 1st function
N(15)=30(15)-(15)^2
=450-225
=225 so yeah i don't understand the result, what does this one equal to? I'm just confused on how to obtain the results i need here.
 
Physics news on Phys.org
225 is N(15). I guess that's the 'maximum number of separate conversations occurring'. I think you've solved the problem.
 
lol, see, that is what happens when you doubt yourself all the time like i do hahaha.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top