Can a modern CAS solve this limit. I tried   
   with Wolfram Alpha but with no avail:   
      
                n^1 + n^2 + ... + n^(n-1) + n^n   
     lim n->oo  ------------------------------- = ?   
                1^n + 2^n + ... + (n-1)^n + n^n   
      
   Also can a CAS quickly draw an accurate   
   graph of the function f(n), lets say with   
      
   for n=0..1000?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)