Number Theoretic approach please!

Denote by N \mathbb N the set of all positive integers. A function f : N N f : \mathbb N \rightarrow \mathbb N is such that for all positive integers m m and n n , the integer f ( m ) + f ( n ) m n f(m) + f(n) - mn is non-zero and divides m f ( m ) + n f ( n ) mf(m) + nf(n) .

Then find the value of f ( 5 ) f(5) .


The answer is 25.

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

Jesse Nieminen
Aug 12, 2017

f ( m ) + f ( n ) m n m f ( m ) + n f ( n ) 2 f ( n ) n 2 2 n f ( n ) 2 f ( n ) n 2 n 3 2 f ( 1 ) 1 1 f ( 1 ) = 1 f(m) + f(n) - mn \mid mf(m) + nf(n) \implies 2f(n) - n^2 \mid 2nf(n) \implies 2f(n) - n^2 \mid n^3 \implies 2f(1) - 1 \mid 1 \implies f(1) = 1

f ( m ) + f ( n ) m n m f ( m ) + n f ( n ) f ( n ) n + 1 n f ( n ) + 1 f ( n ) n + 1 n 2 n + 1 f ( 5 ) 4 21 f ( 5 ) { 7 , 11 , 25 } f(m) + f(n) - mn \mid mf(m) + nf(n) \implies f(n) - n + 1 \mid nf(n) + 1 \implies f(n) - n + 1 \mid n^2 - n + 1 \implies f(5) - 4 \mid 21 \\ \implies f(5) \in \{7, 11, 25\}

2 f ( n ) n 2 n 3 2 f ( 5 ) 25 125 f ( 5 ) { 13 , 15 , 25 , 50 } 2f(n) - n^2 \mid n^3 \implies 2f(5) - 25\mid125 \\ \implies f(5) \in \{13, 15, 25, 50\}

Hence, f ( 5 ) = 25 f(5) = \boxed{25} .

@Jesse Nieminen ,

This is an IMO 2016 shortlisted problem.

Though i have upvoted it, can you elaborate it more perfectly?

Also you have to prove that f ( n ) = n 2 f(n) = n^2 for every integer., is the only solution.

Sorry, but this is not the elegant solution.

Priyanshu Mishra - 3 years, 9 months ago

Log in to reply

For the question that you asked, this is a great solution. It shows how one can isolate the relevant facts to determine the value of f ( 5 ) f(5) .

Calvin Lin Staff - 3 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...