Let for all integers Find the sum of all positive integers such that is relatively prime to all the numbers in the sequence
If you think there are infinitely such input -1 as your answer.
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.
We will show that, for any prime p , there exists an n such that p ∣ a n , therefore showing that the only possible value of m is 1.
First, we can check that 2 ∣ a 1 and 2 0 1 7 ∣ a 2 0 1 6 , the latter due to Fermat's Little Theorem .
Now, let p be a prime such that p = 2 , 2 0 1 7 . We claim that p ∣ a p − 2 .
Since p is neither 2 nor 2017, we can say that if p ∣ 4 0 3 4 a p − 2 , the p ∣ a p − 2 . Now, with a little algebraic manipulation and FLT, we get
4 0 3 4 a p − 2 ≡ 4 0 3 4 ( 2 p − 2 + 2 0 1 7 p − 2 + 2 0 1 5 ⋅ 4 0 3 4 p − 2 − 1 ) ≡ 2 0 1 7 ⋅ 2 p − 1 + 2 ⋅ 2 0 1 7 p − 1 + 2 0 1 5 ⋅ 4 0 3 4 p − 1 − 4 0 3 4 ≡ 2 0 1 7 + 2 + 2 0 1 5 − 4 0 3 4 ≡ 0 ( m o d p ) .
Thus, p ∣ 4 0 3 4 a p − 2 , so p ∣ a p − 2 . This means that if m has any prime factors, then there exists an n such that a n shares at least one of those prime factors. Thus, m can only be equal to 1 , which is the final answer.