Find the remainder when is divided by
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.
The problem can be expressed as 1 2 3 4 4 3 2 1 ( m o d 4 3 2 1 )
Since 4 3 2 1 = 2 9 × 1 4 9 and 2 9 and 1 4 9 are prime numbers, we can use Fermat's Little Theorem and Chinese Remainder Theorem to find out the final result. But, first, we should change the expression above becomes : 1 2 3 4 4 3 2 1 ≡ { 1 2 3 4 4 3 2 1 ( m o d 2 9 ) 1 2 3 4 4 3 2 1 ( m o d 1 4 9 )
Now, using Fermat's Little Theorem we have 1 2 3 4 4 3 2 1 ≡ { 1 2 3 4 4 3 2 1 ≡ ( 1 2 3 4 2 8 ) 1 5 4 × 1 2 3 4 9 ≡ 1 × 1 2 3 4 9 ( m o d 2 9 ) 1 2 3 4 4 3 2 1 ≡ ( 1 2 3 4 1 4 8 ) 2 9 × 1 2 3 4 2 9 ≡ 1 × 1 2 3 4 2 9 ( m o d 1 4 9 )
then, 1 2 3 4 4 3 2 1 ≡ { 1 2 3 4 9 ≡ 1 6 9 ≡ 2 4 ( m o d 2 9 ) 1 2 3 4 2 9 ≡ 4 2 2 9 ≡ 1 3 0 ( m o d 1 4 9 )
Combine these result by using Chines Reminder Theorem to find the final result
1 2 3 4 4 3 2 1 ≡ 2 4 × 1 4 9 × 2 2 + 1 3 0 × 2 9 × 3 6 0 ≡ 2 1 4 3 9 2 ≡ 2 6 6 3 ( m o d 4 3 2 1 )