Consider any sequence of 2 0 1 8 positive integers { a 1 , a 2 , … , a 2 0 1 8 } , and extend it periodically to an infinite sequence { a 1 , a 2 , … } by defining a i + 2 0 1 8 = a i for all i ≥ 1 . The sequence { a 1 , a 2 , … , a 2 0 1 8 } is called Mishra-interesting if
Let N be the number of Mishra-interesting sequences { a 1 , a 2 , … , a 2 0 1 8 } .
Submit the last 1 2 digits of N in base 1 0 , i.e. submit N mod 1 0 1 2 .
If there are an infinite number of Mishra-interesting sequences, submit − 1 .
Inspired by this problem
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.
Problem Loading...
Note Loading...
Set Loading...
Hints:
In the problem, replace 2 0 1 8 with n , and let N n be the number of Mishra-interesting sequences for fixed n ≥ 1 . So N = N 2 0 1 8 . The generating function for N n is
n = 1 ∑ ∞ N n x n = 2 x ( 1 − x ) 1 − 2 x − 1 − 4 x .
Alternatively,
N n = k = 1 ∑ n k ! ( k + 1 ) ! ( 2 k ) ! .