Let be integer. The integer is achievable if there exists satisfying the equation, otherwise it is NOT achievable .
How many positive integers , where , is achievable?
Note: is achievable while is NOT achievable.
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.
Let's f ( x ) = ⌊ 1 ! x ⌋ + ⌊ 2 ! x ⌋ + ⌊ 3 ! x ⌋ .
We have f ( x + 1 ) − f ( x ) = ⌊ 1 ! x + 1 ⌋ + ⌊ 2 ! x + 1 ⌋ + ⌊ 3 ! x + 1 ⌋ − ⌊ 1 ! x ⌋ − ⌊ 2 ! x ⌋ − ⌊ 3 ! x ⌋
= ( ⌊ 1 x + 1 ⌋ − ⌊ 1 x ⌋ ) + ( ⌊ 2 x + 1 ⌋ − ⌊ 2 x ⌋ ) + ( ⌊ 6 x + 1 ⌋ − ⌊ 6 x ⌋ )
≥ 1 + 0 + 0 = 1
So we can conclude that f ( a ) = f ( b ) ∀ a = b . Also with a little calculation we have f ( 1 2 1 0 ) = 2 0 1 6 , that means from 1 to 2016 there are 1 2 1 0 value of f ( x )