Let a 1 , a 2 , … , a n be a sequence of posiitve integers except that a 1 ≥ 0 and a n ≥ 2 . Then the continued fraction [ a 1 ; a 2 , … , a n ] is defined as [ a 1 ; a 2 , … , a n ] = a 1 + a 2 + a 3 + ⋱ + a n 1 1 1 1 . The following are two examples of how we can express a fraction in its continued fraction form: 5 1 2 = [ 2 ; 2 , 2 ] = 2 + 2 + 2 1 1 and 7 3 = [ 0 ; 2 , 3 ] = 0 + 2 + 3 1 1 , where it happens to be the case that three numbers ( 2 , 2 , 2 ) or ( 0 , 2 , 3 ) were used for each. Thus, if we define f ( A , B ) as the total number of integers used in the continued fraction form of the fraction B A , where A and B are positive integers, then f ( 1 2 , 5 ) = f ( 3 , 7 ) = 3 .
Find the maximum value of f ( m , 2 0 1 8 ) for all positive integers m .
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.
No explanations have been posted yet. Check back later!
Problem Loading...
Note Loading...
Set Loading...