What is the remainder when 2 1 ! is divided by 2 3 ?
Notation: ! denotes the factorial notation . For example: 8 ! = 1 × 2 × 3 × 4 × 5 × 6 × 7 × 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.
By Wilson's theorem , ( n − 1 ) ! ≡ − 1 (mod n) , where positive integer n > 1 is a prime. Since 23 is a prime,
2 2 ! 2 2 × 2 1 ! ⟹ 2 1 ! ≡ − 1 (mod 23) ≡ 2 2 (mod 23) ≡ 1 (mod 23)
Problem Loading...
Note Loading...
Set Loading...
Let, 2 1 ! ≡ a ( m o d 2 3 ) 2 2 ⋅ 2 1 ! ≡ 2 2 ⋅ a ( m o d 2 3 ) 2 2 ! ≡ 2 2 ⋅ a ( m o d 2 3 )
But, from Wilson's theorem, we know that 2 2 ! ≡ − 1 ( m o d 2 3 )
∴ 2 2 ⋅ a ≡ 2 2 ! ≡ − 1 ( m o d 2 3 ) 2 2 ⋅ a ≡ − 1 ( m o d 2 3 ) 2 2 ⋅ a ≡ − 1 + 2 3 ( m o d 2 3 ) 2 2 ⋅ a ≡ 2 2 ( m o d 2 3 ) a ≡ 1 ( m o d 2 3 )
Hence we get the remainder as 1