Your mind will explode 3

The decimal representation of m n , \dfrac mn, where m m and n n are relatively prime positive integers and m < n , m < n, contains the digits 2 , 5 2, 5 , and 1 1 consecutively, and in that order. Find the smallest value of n n for which this is possible.


The answer is 127.

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.

2 solutions

Patrick Corn
Sep 23, 2015

First of all, suppose 251 251 appears in the expansion of m / n m/n . Then 1 0 k m / n = 0.251 10^k m/n = 0.251\ldots plus an integer d d , so 1 0 k m n d n = 0.251 \dfrac{10^k m - nd}{n} = 0.251 \ldots .

So we can assume that 0.251 m / n < 0.252 0.251 \le m/n < 0.252 . Since n < 4 m n < 4m , we can write n = 4 m a n = 4m-a for some positive integer a a . Then we have m 4 m a < 0.252 , \dfrac{m}{4m-a} < 0.252, which leads after some algebra to m > 63 a / 2 m > 63a/2 . Since we are trying to minimize n n , we should clearly take a = 1 a = 1 (otherwise m m would be at least 63 63 and n n would be at least 63 / 0.252 = 250 63/0.252 = 250 ). So the smallest m m we can take is m = 32 m = 32 , n = 127 n = \fbox{127} .

Munem Shahriar
Oct 11, 2017

To find the smallest value of n , n, we consider when the first three digits after the decimal point are 0.251 0.251\ldots .

Otherwise, suppose the number is in the form of m n = 0. X 251 , \dfrac{m}{n} = 0.X251 \ldots, were X X is a string of k k digits and n n is small as possible. Then 1 0 k m n X = 1 0 k m n X n = 0.251 10^k \cdot \dfrac{m}{n} - X = \dfrac{10^k m - nX}{n} = 0.251 \ldots . Since 1 0 k m n X 10^k m - nX is an integer and 1 0 k m n X n \dfrac{10^k m - nX}{n} is a fraction between 0 0 and 1 , 1, we can rewrite this as 1 0 k m n X n = p q , \dfrac{10^k m - nX}{n} = \dfrac{p}{q}, where q n . q \le n. Then the fraction p q = 0.251 \dfrac pq = 0.251 \ldots suffices.

So we have m n = 0.251 \dfrac{m}{n} = 0.251\ldots , or

251 1000 m n < 252 1000 251 n 1000 m < 252 n n 250 ( 4 m n ) < 2 n . \frac{251}{1000} \le \frac{m}{n} < \frac{252}{1000} \Longleftrightarrow 251n \le 1000m < 252n \Longleftrightarrow n \le 250(4m-n) < 2n.

As 4 m > n , 4m > n, we know that the minimum value of 4 m n 4m - n is 1 ; 1;

hence we need 250 < 2 n 125 < n 250 < 2n \Longrightarrow 125 < n . Since 4 m n = 1 , 4m - n = 1, we need n + 1 n + 1 to be divisible by 4 , 4, and this first occurs when n = 127 n = \boxed{ 127 }

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...