Find the largest possible value of such that, when is divided by 2017, it gives a remainder of 1.
Notation:
is the
factorial
notation. For example,
.
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.
If n ≥ 2 0 1 7
2 0 1 7 ∣ n ! ⟹ 2 0 1 7 ∤ n ! − 1
If n = 2 0 1 6 , by Wilson's theorem
2 0 1 6 ! ≡ − 1 m o d 2 0 1 7 ⟹ 2 0 1 6 ! − 1 ≡ − 2 m o d 2 0 1 7 ⟹ 2 0 1 7 ∤ 2 0 1 6 ! − 1
If n = 2 0 1 5
2 0 1 6 ! ≡ 2 0 1 6 m o d 2 0 1 7 ⟹ g cd ( 2 0 1 6 , 2 0 1 7 ) = 1 2 0 1 5 ! ≡ 1 m o d 2 0 1 7 ⟹ 2 0 1 5 ! − 1 ≡ 0 m o d 2 0 1 7 ⟹ 2 0 1 7 ∣ 2 0 1 5 ! − 1
Thus, 2 0 1 5 is the largest number that satisfies the constraint