The decimal representation of n m , where m and n are relatively prime positive integers and m < n , contains the digits 2 , 5 , and 1 consecutively, and in that order. Find the smallest value of n for which this is possible.
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.
To find the smallest value of n , we consider when the first three digits after the decimal point are 0 . 2 5 1 … .
Otherwise, suppose the number is in the form of n m = 0 . X 2 5 1 … , were X is a string of k digits and n is small as possible. Then 1 0 k ⋅ n m − X = n 1 0 k m − n X = 0 . 2 5 1 … . Since 1 0 k m − n X is an integer and n 1 0 k m − n X is a fraction between 0 and 1 , we can rewrite this as n 1 0 k m − n X = q p , where q ≤ n . Then the fraction q p = 0 . 2 5 1 … suffices.
So we have n m = 0 . 2 5 1 … , or
1 0 0 0 2 5 1 ≤ n m < 1 0 0 0 2 5 2 ⟺ 2 5 1 n ≤ 1 0 0 0 m < 2 5 2 n ⟺ n ≤ 2 5 0 ( 4 m − n ) < 2 n .
As 4 m > n , we know that the minimum value of 4 m − n is 1 ;
hence we need 2 5 0 < 2 n ⟹ 1 2 5 < n . Since 4 m − n = 1 , we need n + 1 to be divisible by 4 , and this first occurs when n = 1 2 7
Problem Loading...
Note Loading...
Set Loading...
First of all, suppose 2 5 1 appears in the expansion of m / n . Then 1 0 k m / n = 0 . 2 5 1 … plus an integer d , so n 1 0 k m − n d = 0 . 2 5 1 … .
So we can assume that 0 . 2 5 1 ≤ m / n < 0 . 2 5 2 . Since n < 4 m , we can write n = 4 m − a for some positive integer a . Then we have 4 m − a m < 0 . 2 5 2 , which leads after some algebra to m > 6 3 a / 2 . Since we are trying to minimize n , we should clearly take a = 1 (otherwise m would be at least 6 3 and n would be at least 6 3 / 0 . 2 5 2 = 2 5 0 ). So the smallest m we can take is m = 3 2 , n = 1 2 7 .