Function minimum value

Number Theory Level pending

The function f ( n ) = a ( n ! ) + b f(n)= a(n!)+b , where a a and b b are positive integers, is defined for all positive integers. If the range of f f contains two numbers that differ by 20, what is the least possible value of f ( 1 ) f(1) ?

1 5 10 2

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

Select two values of the function, and we have f ( y ) f ( x ) = 20 f(y)-f(x)=20 . Therefore, f ( y ) f ( x ) = a ( y ! ) + b ( a ( x ! ) + b ) f(y)-f(x)=a(y!)+b-(a(x!)+b) . Simplifying, we get a ( y ! x ! ) = 20 a(y!-x!)=20 . Since the function is defined for all positive integers, we try finding ordered pairs that are factors of 20. (1,20); (2,10); (4,5). the values of the first 5 factorials are shown: 1!=1; 2!=2; 3!=6; 4!=16, 5!=120. Now, try substituting values for a based off the ordered pairs. We see that if a=4, 3!-1!=5. Now we know a is 4, b can be any positive integer. But since we want to find the minimum value that f ( 1 ) f(1) can take on, we pick b=1. f ( 1 ) = 4 ( 1 ! ) + 1 = 5 f(1)=4(1!)+1=5 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...