Find the number of integer solutions to the equation above.
Notation: is the factorial notation. For example, .
Other problems: Check your Calibre
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.
Suppose an integer solution existed, say a . Note that for any integer x , the given expression has the coefficients of x 2 0 1 4 , x 2 0 1 3 , . . . , x 1 even. So a 2 0 1 6 + ( 2 0 1 6 ! + 1 ! ) a 2 0 1 5 + . . . + ( 2 ! + 2 0 1 5 ! ) a + ( 1 ! + 2 0 1 6 ! ) ≡ a 2 0 1 6 + a 2 0 1 5 + 1 ( m o d 2 ) . If a were even, then
0 = a 2 0 1 6 + ( 2 0 1 6 ! + 1 ! ) a 2 0 1 5 + . . . + ( 2 ! + 2 0 1 5 ! ) a + ( 1 ! + 2 0 1 6 ! ) ≡ a 2 0 1 6 + a 2 0 1 5 + 1 ( m o d 2 ) ≡ 0 + 0 + 1 ( m o d 2 ) ≡ 1 ( m o d 2 ) , which is not true.
Thus a is odd. But then 0 = a 2 0 1 6 + ( 2 0 1 6 ! + 1 ! ) a 2 0 1 5 + . . . + ( 2 ! + 2 0 1 5 ! ) a + ( 1 ! + 2 0 1 6 ! ) ≡ a 2 0 1 6 + a 2 0 1 5 + 1 ( m o d 2 ) ≡ 1 + 1 + 1 ( m o d 2 ) ≡ 1 ( m o d 2 ) , which is a contradiction.
Hence our assumption is incorrect, and no solution exists in integers.