Suppose a rational number r < 1 can be expressed as r = n 1 for some positive integer n . The sum of all possible values of r such that the base 2 0 1 4 representation of r is a terminating decimal can be expressed as q p for coprime positive integers p , q . What is the value of p ?
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.
I just forgot to subtract 1 from 4 6 8 1 0 0 7
In the first lemma you say "If n 1 is a terminating decimal in base 2 ⋅ 1 9 ⋅ 4 3 , then n = 2 a ⋅ 1 9 b ⋅ 5 3 c for non-negative integers a , b , c ." But in the proof you actually proved the converse: "If n = 2 a ⋅ 1 9 b ⋅ 5 3 c for non-negative integers a , b , c , then n 1 is a terminating decimal in base 2 ⋅ 1 9 ⋅ 4 3 " . Luckily this is what we need, since both lemmas altoghether say "If it is of the proposed shape, then it works, and if it is not of the proposed shape, it doesn´t".
I'm so proud of myself for having solved this one! ^^
Log in to reply
Great job! Glad you find it challenging enough to be so proud. :D
Problem Loading...
Note Loading...
Set Loading...
Lemma: If n 1 is a terminating decimal in base 2 0 1 4 = 2 ⋅ 1 9 ⋅ 5 3 , then n = 2 a ⋅ 1 9 b ⋅ 5 3 c for non-negative integers a , b , c .
Proof: If we can prove that after moving the decimal point of the base 2 0 1 4 representation enough places to the right, the fraction becomes an integer, then we would have proved that it is a terminating decimal. Note that multiplying a number in base 2 0 1 4 by 2 0 1 4 moves the decimal point one place to the right, just like in base 1 0 , where when we multiply a number by 1 0 it moves the decimal point one place to the right. Let x = max ( a , b , c ) . We multiply our fraction 2 a ⋅ 1 9 b ⋅ 5 3 c 1 by 2 0 1 4 x (moving the decimal x places to the right) to obtain the fraction 2 a ⋅ 1 9 b ⋅ 5 3 c 2 0 1 4 x = 2 a ⋅ 1 9 b ⋅ 5 3 c 2 x ⋅ 1 9 x ⋅ 5 3 x
Clearly 2 a ∣ 2 x , 1 9 b ∣ 1 9 x , and 5 3 c ∣ 5 3 x ; therefore 2 a ⋅ 1 9 b ⋅ 5 3 c 2 x ⋅ 1 9 x ⋅ 5 3 x is an integer and we are done.
Lemma: If n contains a factor that is not 2 , 1 9 , or 5 3 , then n 1 is not a terminating decimal in base 2 0 1 4 .
Proof: Let n = ( 2 a ⋅ 1 9 b ⋅ 5 3 c ) ⋅ ( 3 e 1 ⋅ 5 e 2 ⋅ 7 e 3 ⋯ ) , where e 1 , e 2 , e 3 , … ∈ Z + (this is just the prime factorization form of the number n ). We multiply n 1 by 2 0 1 4 x for some positive integer x to move the decimal point x places to the right. However, notice that for all x , ( 2 a ⋅ 1 9 b ⋅ 5 3 c ) ⋅ ( 3 e 1 ⋅ 5 e 2 ⋯ ) 2 0 1 4 x will only be an integer if e 1 = e 2 = e 3 = ⋯ = 0 , because 3 , 5 , 7 , ⋯ ∣ 2 0 1 4 .
Conclusion: Therefore, the only way for n 1 to be a terminating decimal is when n = 2 a ⋅ 1 9 b ⋅ 5 3 c .
Finishing the problem: We want to find the sum of all values of 2 a ⋅ 1 9 b ⋅ 5 3 c 1 as a , b , c ranges through all non-negative integers. You may calculate this the classic way, but here is a neat trick:
We see that ( 2 0 1 + 2 1 1 + 2 2 1 + ⋯ ) ( 1 9 0 1 + 1 9 1 1 + 1 9 2 1 + ⋯ ) ( 5 3 0 1 + 5 3 1 1 + 5 3 2 1 + ⋯ ) covers every single ordered pair ( a , b , c ) for all a , b , c ≥ 0 . (Convince yourself this is true with the distributive property.) We use the sum of geometric sequence formula for each of the geometric sums, to get the sum of all 2 a ⋅ 1 9 b ⋅ 5 3 c 1 as a , b , c ranges through all non-negative integers as: ( 1 2 ) ( 1 8 1 9 ) ( 5 2 5 3 ) = 4 6 8 1 0 0 7 . However, remember that r < 1 , but we included the case where r = 2 0 ⋅ 1 9 0 ⋅ 5 3 0 1 = 1 . Therefore, we subtract 1 from 4 6 8 1 0 0 7 to get 4 6 8 5 3 9 , and our answer is therefore 5 3 9 . Phew! □