From + To -

Algebra Level 4

How many functions f : Z Z f: \mathbb{Z} \rightarrow \mathbb{Z} are there such that

f ( m + f ( n ) ) = f ( m ) n ? f\left(m + f(n) \right) = f(m) - n \quad ?

None Finitely many, at least one Infinitely many

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

Ivan Koswara
Nov 16, 2016

Let P ( m , n ) P(m,n) be the statement f ( m + f ( n ) ) = f ( m ) n f(m+f(n)) = f(m)-n .

P ( 0 , n ) f ( f ( n ) ) = f ( 0 ) n P(0,n) \implies f(f(n)) = f(0)-n . If for some a , b a,b we have f ( a ) = f ( b ) f(a) = f(b) , then a = f ( 0 ) f ( f ( a ) ) = f ( 0 ) f ( f ( b ) ) = b a = f(0) - f(f(a)) = f(0) - f(f(b)) = b , so f f is injective.

P ( m , 0 ) f ( m + f ( 0 ) ) = f ( m ) P(m,0) \implies f(m+f(0)) = f(m) . Since f f is injective, m + f ( 0 ) = m m+f(0) = m , so f ( 0 ) = 0 f(0) = 0 .

P ( f ( n ) , f ( n ) ) f ( 0 ) = f ( f ( n ) ) n P(-f(n), f(n)) \implies f(0) = f(-f(n)) - n or f ( f ( n ) ) = n f(-f(n)) = n .

P ( m , f ( n ) ) f ( m + f ( f ( n ) ) ) = f ( m ) + f ( n ) P(m,-f(n)) \implies f(m+f(-f(n))) = f(m) + f(n) , or f ( m + n ) = f ( m ) + f ( n ) f(m+n) = f(m) + f(n) . This is the well known Cauchy functional equation, whose solution is f ( x ) = a x f(x) = ax for some integer a a . However, plugging this back, we find that this doesn't satisfy the equation for any a a : f ( m + f ( n ) ) = a ( m + a ( n ) ) = a m + a 2 n f(m+f(n)) = a(m+a(n)) = am + a^2 n , while f ( m ) n = a m n f(m)-n = am - n , which means we need a 2 = 1 a^2 = -1 . So there is no solution.

Great! For such functional equation problems showing that it is injective / surjective / determining the exact range are useful clues in understanding the function clearer.

Calvin Lin Staff - 4 years, 6 months ago
Kushal Bose
Nov 15, 2016

I thought in the following way.Not sure it is right or wrong.

f ( m + f ( n ) ) = f ( m ) n f(m+f(n))=f(m)-n

Putting n -n in place of n n equation becomes:

f ( m + f ( n ) ) = f ( m ) + n f(m+f(-n))=f(m)+n

Subtracting two equations :

f ( m + f ( n ) ) f ( m + f ( n ) ) = 2 n f(m+f(-n))-f(m+f(n))=2 n .

Putting m 0 m-0

f ( f ( n ) ) f ( f ( n ) ) = 2 n f(f(-n))-f(f(n))=2 n

It is clear that f ( n ) f(n) is a polynomial function.Let f ( n ) f(n) has degree l l .Then f ( f ( n ) ) f(f(n)) has degree 2 l 2 l The above equation gives a residue of degree 1 polynomial.The even will cancels out in subtraction.So f ( f ( n ) ) f(f(n)) can have maximum powers of 2 then f ( n ) f(n) can have degree 1 1

After checking it may be seen that there exists no function.

There is no reason (yet) for why f ( n ) f(n) must be a polynomial function. Thus, unfortunately the last part of the solution doesn't work. It is true that there is no polynomial of degree k k that satisfies the conditions, but what about other non-polynomial functions?

Note: Do not let your notation do double duty. If the problem has m m and n n , avoid saying "degree m m ".

Calvin Lin Staff - 4 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...