A Sequential Inequality

Algebra Level pending

Define the sequence { a n } \{ a_n\} as a 1 = 1 a_1=1 , a 2 = 3 a_2=3 and a n = a n 1 + a n 2 a_n=a_{n-1}+a_{n-2} for n 3 n \ge 3 . Find the minimum integer x x such that a n n < x \sqrt[n]{a_n}<x for every positive integer n n .


The answer is 1.75.

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.

1 solution

Nitin Kumar
Apr 21, 2020

Use the second principle of mathematical induction to prove that the minimum value of x is 7/4.

2 pending reports

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...