What is the remainder when 2 0 2 8 ! is divided by 2 0 2 9 ?
Details and assumptions
The factorial of a positive integer n , denoted by n ! , is the product of all positive inegers less than or equal to n . For example, 5 ! = 5 × 4 × 3 × 2 × 1 = 1 2 0 .
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.
This is true for any case where x ! is divided by x + 1 , where x + 1 is prime. The remainder will be x .
is -1 also a correct answer.
Log in to reply
Good point. Technically, yes it is, but in this type of question it is normally assumed that the desired answer is positive. Perhaps the phrasing of the question should have been more specific. At least you still got credit for answering the question; thankfully we get 3 guesses at these problems, unlike in an exam. :)
-1 is also correct
Note that 2 0 2 9 is prime. By Wilson's Theorem,
2 0 2 8 ! ≡ − 1 ( m o d 2 0 2 9 ) ≡ 2 0 2 8 ( m o d 2 0 2 9 ) . □
Problem Loading...
Note Loading...
Set Loading...
This is a direct application of Wilson's Theorem .
Since 2 0 2 9 is prime, we have that
2 0 2 8 ! ≡ − 1 m o d 2 0 2 9 ≡ 2 0 2 8 m o d 2 0 2 9 .
Thus the remainder is 2 0 2 8 .