It continues

Let a 1 , a 2 , , a n a_1, a_2, \ldots ,a_n be a sequence of posiitve integers except that a 1 0 a_1\ge 0 and a n 2 a_n \geq 2 . Then the continued fraction [ a 1 ; a 2 , , a n ] [a_1 ; a_2, \ldots , a_n ] is defined as [ a 1 ; a 2 , , a n ] = a 1 + 1 a 2 + 1 a 3 + 1 + 1 a n . [a_1 ; a_2, \ldots , a_n ] = a_1 + \cfrac1{a_2 + \cfrac1{a_3 + \cfrac1{{\ddots}_{\quad + \cfrac1{a_n}}}}} . The following are two examples of how we can express a fraction in its continued fraction form: 12 5 = [ 2 ; 2 , 2 ] = 2 + 1 2 + 1 2 and 3 7 = [ 0 ; 2 , 3 ] = 0 + 1 2 + 1 3 , \frac{12}5 = [2;2,2] = 2 + \frac1{2 + \frac12}\quad \text{ and }\quad \frac37 = [0;2,3] = 0 + \frac1{2 + \frac13}, where it happens to be the case that three numbers ( 2 , 2 , 2 ) (2, 2, 2) or ( 0 , 2 , 3 ) (0, 2, 3) were used for each. Thus, if we define f ( A , B ) f(A,B) as the total number of integers used in the continued fraction form of the fraction A B , \frac AB, where A A and B B are positive integers, then f ( 12 , 5 ) = f ( 3 , 7 ) = 3. f(12,5)= f(3,7) = 3.

Find the maximum value of f ( m , 2018 ) f(m,2018) for all positive integers m . m.


The answer is 14.

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...