Given that m and n are natural numbers and among all possible rational numbers with the restriction ( m + n ) < 1 5 0 , n m is the best approximation of 1 4 then what is n ?
Use: 1 4 = 3 . 7 4 1 6 5 7 3 8 7 . . .
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.
Not quite. The continued fraction tells us that if n k m k is the partial continued fraction, then it is the best approximation where the denominator is at most n k . Technically, for completeness, you would have to check for denominators slightly larger than 31.
To find rational approximation of 1 4 , we first find the rational number closest to fractional part of 1 4 or 0.7416573. . . or some ratio slightly less than 0 . 7 4 2 = 1 0 0 0 7 4 2 = 5 0 0 3 7 1 . Obviously accepting the ratio 5 0 0 3 7 1 would violate the given restriction on total of (m + n). Let us tackle this problem by finding a solution for 3 7 1 x − 5 0 0 y = 1 by well known techniques which works out to x = 3 1 , y = 2 3 , meaning that 3 1 2 3 is nearest approximation of fractional part. The answer is 31.
U s i n g a c a l c u l a t o r , n x − n − 1 4 = N . S i n c e 3 0 1 2 0 = 4 , w e s t a r t o u r t r i a l s w i t h b i g g e s t p o s s i b l e x f o r b e s t r e s u l t . x = 1 4 9 , n = 3 1 , N = . 0 6 4 7 9 . W e a r e s u r e t h a t t h i s i s t h e b e s t r e s u l t s i n c e t h e r e i s a s i g n c h a n g e o f N f r o m n = 3 0 t o n = 3 2 . x = 1 4 8 , n = 3 1 , N = . 0 3 2 5 . . . . W e a r e s u r e t h a t t h i s i s t h e b e s t r e s u l t s i n c e t h e r e i s a s i g n c h a n g e o f N f r o m n = 3 0 t o n = 3 2 . x = 1 4 7 , n = 3 1 , N = . 0 0 2 7 8 0 9 . W e a r e s u r e t h a t t h i s i s t h e b e s t r e s u l t s i n c e t h e r e i s a s i g n c h a n g e o f N f r o m n = 3 0 t o n = 3 2 . x = 1 4 6 , n = 3 1 , N = . 0 3 . . . . W e a r e s u r e t h a t t h i s i s t h e b e s t r e s u l t s i n c e t h e r e i s a s i g n c h a n g e o f N f r o m n = 3 0 t o n = 3 2 . I t i s c l e a r t h a t x < 1 4 6 w i l l n o t g i v e b e t t e r r e s u l t s . S o n = 3 1 .
Problem Loading...
Note Loading...
Set Loading...
We can solve this question with continued fractions. The following algorithm can be used to find continued fraction approximations.
Take the integer part of the number. This is the first term in the sequence. Then take the reciprocal of the fractional part. Repeat indefinitely, appending terms to the continued fraction as necessary.
You can read more about continued fractions here .
n k 1 4 5 1 4 + 3 2 1 4 + 2 5 1 4 + 2 1 4 + 3 ⌊ n k ⌋ 3 1 2 1 6 n k − ⌊ n k ⌋ 1 4 − 3 5 1 4 − 2 2 1 4 − 2 5 1 4 − 3 1 4 − 3 n k + 1 = n k − ⌊ n k ⌋ 1 5 1 4 + 3 2 1 4 + 2 5 1 4 + 2 1 4 + 3 5 1 4 + 3
Note the repetition of 5 1 4 + 3 here. The terms will repeat, and the integer part of n k will repeat according to the pattern { 1 , 2 , 1 , 6 } after the initial 3 . Thus, 1 4 = [ 3 ; 1 , 2 , 1 , 6 ] . We can use this to approximate 1 4 with arbitrary precision. The first few approximations are as follows: 1 3 , 1 4 , 3 1 1 , 4 1 5 , 2 7 1 0 1 , 3 1 1 1 6 , 8 9 3 3 3 . 3 1 1 1 6 is the closest approximation that still has a numerator and denominator sum to less than 1 5 0 , so the answer is 3 1 .