Mr. Me obviously knows it

22, 35, 48, 61, 74, 87, 100, 113, \text{22, 35, 48, 61, 74, 87, 100, 113,} \dots

Above is a recursive sequence such that T 0 = 22 T_0=22 and T 1 = 35 T_1=35 . And the general term T n T_n for n 2 n \ge 2 is given as T n = 2 T n 1 T n 2 T_n=2T_{n-1}-T_{n-2} .

Write a recursive function using the above definition to find the T n T_n for any integer n 0 n \ge 0 .

What is the n u m b e r number of function calls for getting the 2 2 n d 22^{nd} term ( T 22 ) \left( T_{22} \right) ?

Hint: The n u m b e r number contains 5 5 digits and the digits are 1 1 , 2 2 , 3 3 , 4 4 and 5 5 .


The answer is 35421.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...