( 5 0 ! ) 2 m o d 1 0 1 = ?
Notation: ! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × ⋯ × 8 .
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.
Since 1 0 1 is prime, by Wilson's Theorem , 1 0 0 ! ≡ − 1 ( m o d 1 0 1 ) We observe that 1 0 0 ! = 1 0 0 × 9 9 × 9 8 × ⋯ × 5 1 × ( 5 0 ) ! 1 0 0 ≡ − 1 ( m o d 1 0 1 ) 9 9 ≡ − 2 ( m o d 1 0 1 ) 9 8 ≡ − 3 ( m o d 1 0 1 ) ⋅ ⋅ 5 1 ≡ − 5 0 ( m o d 1 0 1 ) 5 0 ! ≡ 5 0 ! ( m o d 1 0 1 ) Multiplying the above congruence relations, 1 0 0 ! ≡ ( 5 0 ! ) 2 ≡ − 1 ( m o d 1 0 1 ) Therefore, ( 5 0 ! ) 2 ≡ 1 0 0 ( m o d 1 0 1 )
Problem Loading...
Note Loading...
Set Loading...
By a corollary of Wilson's theorem (2) , if p is a prime of the form 4 k + 1 , where k is an integer, then [ ( 2 k ) ! ] 2 ≡ − 1 ( m o d p ) . Since 1 0 1 is of the form 4 k + 1 , where k = 2 5 , then ( 5 0 ! ) 2 ≡ − 1 ≡ 1 0 0 ( m o d 1 0 1 ) .