f ( k m ) + f ( k n ) − f ( k ) f ( m n ) ≥ 1
Denote a function f : N → R such that it satisfy the equation above for all k , m , n .
Find the sum of squares of all possible values 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 solution currently makes the unproven assumption that a solution in N must arise as the restriction of a solution in Z .
No, not all solutions in N would necessarily arise as a restriction from a solution in Z .
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 which satisfies
f ( ⌊ x ⌋ ) = x
Clearly f ( n ) = n satisfies the condition.
Does there exist functional equations f 1 : R → N and f 2 : R → 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.
I think your equation (2) is wrong. Could you please elaborate.
Log in to reply
Oops, it should be m = n = 0 instead of m = 1 , n = 0 .
Problem Loading...
Note Loading...
Set Loading...
We will try to extend the domain of f by defining g : Z → R that satisfy g ( k m ) + g ( k n ) − g ( k ) g ( m n ) ≥ 1 (*) for all k , m , n .
If there is a solution g , that solution will also be a solution of f with a restriction of domain (because N ⊂ Z ). (**)
Substitute k = m = n = 1 in (*) we get 2 g ( 1 ) − g ( 1 ) 2 ≥ 1
Or ( g ( 1 ) − 1 ) 2 ≤ 0 .
Therefore g ( 1 ) = 1 .
Now let m = n = 1 in (*) we get g ( k ) ≥ 1 . (1)
Substitute k = m = n = 0 in (*) we get g ( 0 ) = 1 .
Let m = n = 0 in (*) we get g ( k ) ≤ 1 . (2)
From (1),(2); we get g ( k ) = 1 for all k ∈ Z .
From the statement (**); we get f ( k ) = 1 for all k ∈ N ~~~
If you wonder why we can extend the domain, let's think an easy example:
If we can solve (1), then we can solve (2) but restrict the domain of the variable.