Functional Equations

Algebra Level 5

f ( k m ) + f ( k n ) f ( k ) f ( m n ) 1 \large f(km)+f(kn)-f(k)f(mn)\geq 1

Denote a function f : N R f:\mathbb{N}\rightarrow \mathbb{R} such that it satisfy the equation above for all k , m , n k,m,n .

Find the sum of squares of all possible values of f ( 2015 ) f(2015) .


The answer is 1.

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.

1 solution

We will try to extend the domain of f f by defining g : Z R g: \mathbb{Z} \rightarrow \mathbb{R} that satisfy g ( k m ) + g ( k n ) g ( k ) g ( m n ) 1 g(km)+g(kn)-g(k)g(mn) \geq 1 (*) for all k , m , n k,m,n .

If there is a solution g g , that solution will also be a solution of f f with a restriction of domain (because N Z \mathbb{N} \subset \mathbb{Z} ). (**)

Substitute k = m = n = 1 k=m=n=1 in (*) we get 2 g ( 1 ) g ( 1 ) 2 1 2g(1) - g(1)^{2} \geq 1

Or ( g ( 1 ) 1 ) 2 0 (g(1)-1)^{2} \leq 0 .

Therefore g ( 1 ) = 1 g(1) = 1 .

Now let m = n = 1 m=n=1 in (*) we get g ( k ) 1 g(k) \geq 1 . (1)

Substitute k = m = n = 0 k=m=n=0 in (*) we get g ( 0 ) = 1 g(0) = 1 .

Let m = n = 0 m=n=0 in (*) we get g ( k ) 1 g(k) \leq 1 . (2)

From (1),(2); we get g ( k ) = 1 g(k) = 1 for all k Z k \in \mathbb{Z} .

From the statement (**); we get f ( k ) = 1 f(k) = 1 for all k N k \in \mathbb{N} ~~~


If you wonder why we can extend the domain, let's think an easy example:

  • Solve x 3 2 x + 1 = 0 x^{3}-2x+1 = 0 in R \mathbb{R} . (1)
  • Solve y 3 2 y + 1 = 0 y^{3}-2y+1 = 0 in Z \mathbb{Z} . (2)

If we can solve (1), then we can solve (2) but restrict the domain of the variable.

Moderator note:

This solution currently makes the unproven assumption that a solution in N \mathbb{N} must arise as the restriction of a solution in Z \mathbb{Z} .

No, not all solutions in N \mathbb{N} would necessarily arise as a restriction from a solution in Z \mathbb{Z} .

Calvin Lin Staff - 6 years ago

Log in to reply

I don't quite understand why. Can you please provide some counter-example?

Log in to reply

Simple counter example. Consider the functional equation f : N N f: \mathbb{N} \rightarrow \mathbb{N} which satisfies

f ( x ) = x f( \lfloor x \rfloor ) = x

Clearly f ( n ) = n f(n) = n satisfies the condition.

Does there exist functional equations f 1 : R N f_1: \mathbb{R} \rightarrow \mathbb{N} and f 2 : R R f_2 : \mathbb{R} \rightarrow \mathbb{R} which satisfies the above condition?

Thus, it is not always possible that a solution over the integers can be extended to a solution over the reals. The direction that is true, is that a solution over the reals can be restricted to a solution over the integers.

Calvin Lin Staff - 6 years ago

I think your equation (2) is wrong. Could you please elaborate.

Log in to reply

Oops, it should be m = n = 0 m = n = 0 instead of m = 1 , n = 0 m = 1, n = 0 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...