Didn't I See You Before?

Consider the following arithmetic sequence { a n } n = 1 \left \{a_n \right \}_{n=1}^\infty of positive integers:

10000 , 10210 , 10420 , 10000, 10210, 10420, \cdots

Find the smallest positive integer m m for which there exists at least one positive integer n n , where n < m n<m such that a m a n (mod 2016) a_m \equiv a_n \text{ (mod 2016)}


The answer is 49.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...