f ( x + x y ) = f ( x ) + f ( x ) f ( y ) + 2 y
Let f ( x ) : Q + → R be a function such that it satisfies the above functional equation for every x , y belonging to the set of positive rational numbers. Then find the value of f ( 2 0 1 5 ) .
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.
This approach shows that on the integers, we have f ( n ) = n 2 . How can we extend this function to the rationals? Can it be extended to the irrationals in another way?
Awesome question sir... but instead of taking {Case 1: y=x and Case 2: y=2x} if we take {Case 1:x=y=k(some integer) and Case 2:x=k and y=0} the solution becomes lot simpler.
by using little logical thing we will easily get f(k)=k^2
We are given f ( x + x y ) = f ( x ) + f ( x ) f ( y ) + 2 y
Now, plug x = y , we get:
f ( x + 1 ) = f ( x ) + 1 + 2 x
Now, add x 2 to both the sides
f ( x + 1 ) + x 2 = f ( x ) + 1 + 2 x + x 2
⇒ f ( x + 1 ) + x 2 = f ( x ) + ( x + 1 ) 2
⇒ f ( x + 1 ) − ( x + 1 ) 2 = f ( x ) − x 2
Now, define g ( x ) = f ( x ) − x 2
So, we get :
g ( x + 1 ) = g ( x ) ⇒ g i s a c o n s t a n t f u n c t i o n
So, let g ( x ) = c
⇒ f ( x ) = x 2 + c
Plugging f ( x ) = x 2 + c in the parent equation, we get :
x 2 + x 2 y 2 + 2 y + c = x 2 + c + x 2 + c y 2 + c + 2 y
⇒ x 2 y 2 = x 2 + c y 2 + c
⇒ c x 2 = c y 2
⇒ c = 0
Hence, f ( x ) = x 2
So, f ( 2 0 1 5 ) = 2 0 1 5 2 = 4 0 6 0 2 2 5
plug in x=y then get: f(x+1)=f(x)+1+2x f(x+1)-f(x)=2x+1 let n be an integer: f(n+1)-f(n)=2x+1 we know from arithmetic series that if a(n+1)-a(n)=an+b that means that a(n) can be a sum of an arithmetic series therefore is a quadradic function with no "c". one can solve the equation by defining f(n)= an^2+bn. after that one gets that f(n)=n^2 and therefore f(2015)=2015^2
Putting y = x = n
We have following recurrence
f ( n + 1 ) − f ( n ) = 2 n + 1 .
Now taking summation as n varies from 1 to 2014
f ( 2 0 1 5 ) = f ( 1 ) + 2 0 1 4 × 2 0 1 6 .
Put y = 2 x in first equation and use the recurrence relation to get
f ( 2 x ) = 4 f ( x ) .
f ( 2 ) = 4 f ( 1 ) .
Now using recurrence relation f ( 2 ) = f ( 1 ) + 3 .
Therefore f ( 1 ) = 1.
Hence the conclusion follows
Problem Loading...
Note Loading...
Set Loading...
It is given that f ( x + x y ) = f ( x ) + f ( x ) f ( y ) + 2 y
y = x y = 2 x ( 3 ) − ( 2 ) : ( 4 ) : x = 1 : ( 1 ) : x = 1 : ( 4 a ) = ( 1 a ) : ⇒ f ( x + 1 ) ⇒ f ( x + 2 ) ⇒ f ( x + 2 ) 0 ⇒ f ( 2 x ) f ( 2 ) f ( 2 ) 4 f ( 1 ) f ( 1 ) = f ( x ) + 1 + 2 x = f ( x + 1 ) + 1 + 2 ( x + 1 ) = f ( x ) + 4 x + 4 = f ( x ) + f ( x ) f ( 2 x ) + 4 x = f ( x ) f ( 2 x ) − 4 = 4 f ( x ) = 4 f ( 1 ) = f ( 1 ) + 3 = f ( 1 ) + 3 = 1 . . . ( 1 ) . . . ( 2 ) . . . ( 3 ) . . . ( 4 ) . . . ( 4 a ) . . . ( 1 a )
From ( 1 ) we have:
f ( x + 1 ) ⇒ x = 1 ∑ n f ( x + 1 ) x = 1 ∑ n f ( x + 1 ) − x = 1 ∑ n f ( x ) x = 1 ∑ n + 1 f ( x ) − f ( 1 ) − x = 1 ∑ n f ( x ) x = 1 ∑ n + 1 f ( x ) − x = 1 ∑ n f ( x ) f ( n + 1 ) ⇒ f ( n ) ⇒ f ( 2 0 1 5 ) = f ( x ) + 2 x + 1 = x = 1 ∑ n ( f ( x ) + 2 x + 1 ) = x = 1 ∑ n f ( x ) + n ( n + 1 ) + n = n 2 + 2 n = n 2 + 2 n = n 2 + 2 n + f ( 1 ) = n 2 + 2 n + 1 = ( n + 1 ) 2 = n 2 = 2 0 1 5 2 = 4 0 6 0 2 2 5