Consider the following recursively defined sequence: where
For how many positive integers is
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.
Since we want a 2 = 2 1 and a 1 = 1 , we must have b = 2 . Consider the b = 2 case. Then a n = 1 + a n − 1 a n − 1 , so that a n a n − 1 + a n = a n − 1 , and hence 1 + a n − 1 − 1 = a n − 1 With a 1 = 1 it is a simple induction that a n − 1 = n , and hence that a n = n − 1 . Thus we obtain a n = n − 1 precisely when b = 2 , making the answer 1 .