MHB Express $a_n$ in $n$: Recursive Formula

  • Thread starter Thread starter Albert1
  • Start date Start date
Albert1
Messages
1,221
Reaction score
0
$a_0=1, a_n=\dfrac {a_{n-1}}{1+(n-1)\times a_{n-1}}$
for all $n\geq 1$
express $a_n$ in $n$
 
Mathematics news on Phys.org
My solution:

Computation of the first few terms suggests the closed form is:

$$a_n=\frac{2}{n^2-n+2}$$

As a check we may write:

$$\frac{a_{n-1}}{1+(n-1)a_{n-1}}=\frac{\dfrac{2}{(n-1)^2-(n-1)+2}}{1+(n-1)\dfrac{2}{(n-1)^2-(n-1)+2}}=\frac{2}{(n-1)^2-(n-1)+2+2(n-1)}=\frac{2}{n^2-2n+1-n+1+2+2n-2}=\frac{2}{n^2-n+2}=a_n$$

This closed form satisfies the given initial value, and the given non-linear recurrence, and so we may state:

$$a_n=\frac{2}{n^2-n+2}$$
 
nice try !
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...

Similar threads

Replies
4
Views
3K
Replies
1
Views
1K
Replies
2
Views
3K
Replies
3
Views
2K
Replies
2
Views
1K
Back
Top