Hey guys and gals ! This is the answer of my query post 'Factorial series'.
[ j=1 ][ n ] j j . j !
Well what I think, the series practically bursts (neither infinite nor finite but increasing w.r.t a common variable ) as n increases which is absolutely not significant.But if I consider the entire series to be a convergent function f(n) then according to combinatrical reasoning and statistical induction and common variable say j must vary from 1 to n which can exactly be done in terms of summation.Then I applied the 3rd principle of Game theory to get the answer.But this is an Olympiad Level question not for IIT standard,I am sorry to ask such question.It will look weired to all you users. I don't think this can be solved in simpler ways.I have to ask my friends in resonance whether they are just kiding .
Moderation Team
![[Post New]](/templates/default/images/icon_minipost_new.gif){kind=icon}
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
562
[ n ] j j . j !
