A Function All The Way

Algebra Level 4

Find the natural number a a for which

k = 1 n f ( a + k ) = 16 ( 2 n 1 ) \large\sum_{k=1}^{n} f(a+k)=16(2^n-1)

where the function f f satisfies the relation f ( x + y ) = f ( x ) × f ( y ) f(x+y)=f(x)\times f(y) for all natural numbers x , y x,y and further f ( 1 ) = 2 f(1)=2 . If a 2 f ( a ) = m n \dfrac{a^2}{f(a)}=\dfrac{m}{n} , where m m and n n are coprime positive integers, enter your answer as m + n m+n .

This question belongs to the set Functions are awesome


The answer is 17.

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

We know f ( x + y ) = f ( x ) × f ( y ) f(x+y)=f(x)\times f(y) and f ( 1 ) = 2 f(1)=2

f ( x ) = f ( 1 + 1 + 1... \Rightarrow f(x)=f(1+1+1... x x t i m e s ) times)

f ( x ) = [ f ( 1 ) ] x \Rightarrow f(x)=[f(1)]^x

f ( x ) = 2 x \Rightarrow f(x)=2^x , since f ( 1 ) = 2 f(1)=2 .

Therefore f ( a + k ) = 2 a × 2 k f(a+k)=2^a\times2^k

k = 1 n f ( a + k ) = 2 a × 2 1 + 2 a × 2 2 + 2 a × 2 3 . . . . . . . 2 a × 2 n \large\Rightarrow \sum_{k=1}^{n} f(a+k)=2^a\times2^1+2^a\times2^2+2^a\times2^3 .......2^a\times2^n

k = 1 n f ( a + k ) = 2 a [ 2 ( 1 2 n ) ] 1 2 \large\Rightarrow \sum_{k=1}^{n} f(a+k)=\large\frac{2^a[2(1-2^n)]}{1-2} using the formula of G.P.

k = 1 n f ( a + k ) = [ 2 a + 1 2 n + a + 1 ) ] 1 \large\Rightarrow \sum_{k=1}^{n} f(a+k)=\large\frac{[2^{a+1}-2^{n+a+1})]}{-1} , which is equal to 16 ( 2 n 1 ) 16(2^n-1) , according to the question.

Therefore [ 2 a + 1 2 n + a + 1 ) ] 1 = 16 ( 2 n 1 ) \large\frac{[2^{a+1}-2^{n+a+1})]}{-1}=16(2^n-1)

Simplyfying we get 2 a + 1 = 16 2^{a+1}=16

which gives a = 3 a=3 .

a 2 f ( a ) = 3 2 2 3 = 9 8 \large\frac{a^2}{f(a)}=\frac{3^2}{2^3}=\frac{9}{8}

So, the answer is 9 + 8 = 17 9+8=\boxed{17}

Chew-Seong Cheong
Jan 26, 2018

It appears that f ( n ) = 2 n f(n)=2^n for the first few n n . Let us prove that the claim is true for all n 1 n \ge 1 .

Proof: For n = 1 n=1 , f ( 1 ) = 2 1 = 2 f(1) = 2^1 = 2 as given, therefore, the claim is true for n = 1 n=1 . Now, assuming the claim is true for n n , then f ( n + 1 ) = f ( 1 ) f ( n ) = 2 × 2 n = 2 n + 1 f({\color{#D61F06}n+1}) = f(1)f(n) = 2\times 2^n = 2^{\color{#D61F06}n+1} , therefore, the claim is also true for n + 1 n+1 hence it is true for all n 1 n \ge 1 .

Now, we have k = 1 n f ( a + k ) = k = 1 n f ( a ) f ( k ) = f ( a ) k = 1 n f ( k ) = 2 a k = 1 n 2 k = 2 a + 1 ( 2 n 1 2 1 ) = 2 a + 1 ( 2 n 1 ) \displaystyle\sum_{k=1}^n f(a+k) = \sum_{k=1}^n f(a)f(k) = f(a) \sum_{k=1}^n f(k) = 2^a \sum_{k=1}^n 2^k = 2^{a+1} \left(\frac {2^n-1}{2-1}\right) = 2^{a+1} \left(2^n-1 \right) .

Therefore, 2 a + 1 = 16 = 2 4 a + 1 = 4 a = 3 2^{a+1} = 16 = 2^4 \implies a+1=4 \implies a = \boxed{3} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...