Denote by the set of all positive integers. A function satisfies
for all .
Find .
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.
From the pattern in the equation it may be concluded that f ( x ) = x
For confirmation I am going to show two cases.
Case(1): f ( x ) < x ⟹ f ( m ) < m ⟹ f 2 ( m ) < m 2
Similar for f 2 ( n ) < n 2
f 2 ( m ) + 2 f 2 ( n ) < m 2 + 2 n 2 f ( f 2 ( m ) + 2 f 2 ( n ) < f ( m 2 + 2 n 2 ) < m 2 + 2 n 2 )
So, it contradicts the question then f ( x ) ≮ x
Case(2) f ( x ) > x ⟹ f ( m ) > m ⟹ f 2 ( m ) > m 2
Similar for f 2 ( n ) > n 2
f 2 ( m ) + 2 f 2 ( n ) > m 2 + 2 n 2 f ( f 2 ( m ) + 2 f 2 ( n ) > f ( m 2 + 2 n 2 ) > m 2 + 2 n 2 )
So, it contradicts the question then f ( x ) ≯ x
So, the last option is f ( x ) = x