| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 18:29:23 IST
|
|
|
|
Time wounds all heels |
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:05:03 IST
|
|
|
f(x) = x (n-1)n 1st derivative is n(n-1)x [(n-1)n -1] this way we get n the derivative as (n(n-1)-0) (n(n-1) -1) (.....) ( n(n-1) - (n-1) * x (n(n-1) - n) x = 1 so we get (n(n-1)-0) (n(n-1) -1) (.....) ( n(n-1) - (n-1)) of the form t(t-1)(t-2)(t-3) ..(t-(n-1)) [n(n-1)] ! / [n(n-2)] !
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:08:28 IST
|
|
|
hey, you've noted down the function wrongly i think.
|
Time wounds all heels |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:10:51 IST
|
|
|
is it n!(0) =0
nudge me if im wrong
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:31:28 IST
|
|
|
edited
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:36:55 IST
|
|
|
I think it is nC0(2n)!-nC1(2n-1)!+nC2(2n-2)!-....+nCn(n)! Binomially expanding the function, nC0x2n-nC1x2n-1+nC2x2n-2-.....nCnxn now after taking n derivatives power of derivative keeps reducing and so we have 2n*(2n-1)...1=2n!, (2n-1)! and so on
|
" Always remember money isn't everything but make sure you have made a lot of it before talking such nonsense!"
- Bill Gates |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 19:39:03 IST
|
|
|
elasti: just verify your answers substituting n=1, n=2 etc. the expression does not become zero at the nth derivative. akhil also needs to check his working.
|
Time wounds all heels |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 20:21:47 IST
|
|
|
P=(2n!) ci =nCr c0P-c1P/2n+c2P/(2n)(2n-1)-c3P/(2n)(2n-1)(2n-2)+...
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 21:15:42 IST
|
|
|
is it (n^n)*(n!)
|
Nitwit Blubber Odment Tweak
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 21:30:32 IST
|
|
|
That's fantastic computer001, just go ahead and post ur solution
|
Time wounds all heels |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 21:38:36 IST
|
|
|
f(x)=(x^n-1)^n 1st derivative=(n^2)((x^n-1)^n-1)*x^n-1 now basically we need to bother only abt the terms in which differentiation of (x-1)^n goes on as in the other terms when u later substitue x=1 they become 0 anyway..in the nth derivative the (x-1)^n term which was there initially becomes(x-1)^0..so this term alond with its coeff and x power sometihng is the only 1 which does not become 0 for x=1..the coeff of this will be n^n*n! as on each diff 'n' is contributed due to the x^n inside the bracket and overall n! is produced due to continuous diff of the initial (...)^n..
|
Nitwit Blubber Odment Tweak
|
this reply: 15 points
(with 3 
in 3 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 21:39:32 IST
|
|
|
i din do ne calculations so i cant exactly post a 'solution'..this is the way i reasoned it out...hope its clear..
|
Nitwit Blubber Odment Tweak
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 12 Mar 2008 22:00:45 IST
|
|
|
the answer is right. great job computer!
But, any volunteers for a working that can be easily understood.
|
Time wounds all heels |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|