Google Answers Logo
View Question
Q: math problem ( No Answer,   2 Comments )
Subject: math problem
Category: Science > Math
Asked by: appusavla-ga
List Price: $3.00
Posted: 28 Sep 2006 11:27 PDT
Expires: 02 Oct 2006 06:44 PDT
Question ID: 769261
Let f(n) be a function on the non-negative integers defined
recursively as follows:

f(0)=1, f(n)=(1+(n*n-n)*f(n-1))/(n*n+1) for n > 0. So f(1)=1/2, f(2)=2/5 ... 

This month's puzzle asks for you to determine the asymptotic behavior
of f(n) as n -> infinity. In other words find a simple function g(x)
such that f(n)/g(n) -> 1 as n -> infinity.
There is no answer at this time.

Subject: Re: math problem
From: barneca-ga on 28 Sep 2006 14:59 PDT
is it cheating to plot the function in excel and look at it?  it
becomes pretty obvious what the asymptotic behavior is...
Subject: Re: math problem
From: yevgenyt-ga on 30 Sep 2006 04:56 PDT
If we assume that for large n, f(n)~f(n-1) then we can change both
f(n) and f(n-1) to g(n). Solving this equation will give us
g(n)=1/(1+n) and it can be verified that indeed this g is one possible

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy