Bunuel wrote:
The function f is defined for all non-negative integers x by the following rule: f(x) = 10...064, where x represents the number of zeros between the "1" and the "64". For example, f(0) = 164, f(1) = 1064, etc. If f(a) = 2^n*k, where k is a positive odd integer and n is a positive integer, what is the maximum possible value of n?
A. 5
B. 6
C. 7
D. 8
E. 9
Although
FauleKatze has made a brilliant effort in simplifying the question, the solution goes wrong towards the end.
F(a)=\(2^n*k\), where k is odd.
We also know that F(a) = 10...(a times 0)...064=
100...(a+2) times 0s + 64 = \(10^{a+2}+64=2^{a+2}*5^{a+2}+2^6\)
Now, \(2^{a+2}*5^{a+2}+2^6=2^n*k\), so \(n=a+2\)
We have to ensure that the portion after taking out 2^x is an odd integer.
1) If we take out \(2^{a+2}\) => \(2^{a+2}(2^{6-a-2}+5^{a+2}\)
We have to maximize a, and \(2^{6-a-2}\) should be least but even, so \(6-a-2=1......a=3\), and
n=3+2=52) If we take out \(2^{6}\) => \(2^{6}(1+2^{a+2-6}*5^{a+2})=2^n*k\)
We have to check whether we can get another 2 from the term \((1+2^{a+2-6}*5^{a+2})\) to increase the value of n.
Now for \(1+2^{a+2-6}*5^{a+2}\) to be even, \(2^{a+2-6}=1.....a=4\).
\(2^{6}(1+2^{a+2-6}*5^{a+2})=2^n*k\)
\(2^{6}(1+5^{4+2})=2^n*k\)
Now when we add 1 to any power of 5, we get an even number that is not divisible by 5 => \(1+5^6=2y\), where y is odd.REASON : \(5^6=(4+1)^6\)...When you divide this by 4 we will always get a remainder 1, so we will have to add another 4-1 or 3 to get a multiple of 4. That is, \(5^x+3\) is a multiple of 4, while \(5^x+1\) is not.
Thus, \(2^{6}(1+5^{4+2})=2^6*2k=2^7*k=2^n*k\)
So the maximum value of n is 7.
C