n = 1 ∑ 9 ( 1 1 × n ) 1 1 × n
Find the last two digits of the above summation.
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.
Like that how can we find the last 3 digits?????????????
Log in to reply
Log in to reply
I already read the solution for the problem you asked to see.Can you please explain it again.
Log in to reply
@Rama Devi – Please reply soon
Log in to reply
@Rama Devi – which part should I explain?
Log in to reply
Log in to reply
@Rama Devi – please explain soon.
Log in to reply
@Rama Devi – ( 2 1 1 ) × 1 0 0 × 1 1 1 + 1 1 1 × 1 1 1 = 5 5 × 1 0 0 + 1 1 1 = 5 6 1 1 ≡ 6 1 1 ( m o d 1 0 0 0 )
Log in to reply
Log in to reply
@Rama Devi – I just show you how to get 611. You can find out other items by following the steps above. Now, look how to get the answer.
6 1 1 × 1 + 3 2 1 × 3 0 4 + 1 3 1 × 5 2 3 + 4 1 × 5 6 + 5 1 × 1 2 5 + 1 6 1 × 4 5 6 + 3 7 1 × 2 0 7 + 6 8 1 × 6 1 6 + 9 1 × 8 8 9 ≡ 6 1 1 + 9 7 5 8 4 + 6 8 5 1 3 + … + 8 0 8 9 9 ≡ 6 1 1 + 5 8 4 + 5 1 3 + 2 9 6 + 3 7 5 + 4 1 6 + 7 9 7 + 4 9 6 + 8 9 9 ≡ 4 9 8 7 ≡ 9 8 7 ( m o d 1 0 0 0 )
Log in to reply
@Mas Mus – Mas Mus, Can I ask? How could 2 2 2 2 = 1 0 0 × C 2 + 2 2 1 × 2 2 2 ? And so on?
Log in to reply
@Victor Zhang – Using Binomial Expansion , we can write the expansion of ( 2 2 ) 2 2 as
( 2 0 + 2 ) 2 2 = 1 0 0 [ ( 0 2 2 ) 1 0 2 0 × 2 2 2 × 2 0 + ( 1 2 2 ) 1 0 1 9 × 2 2 1 × 2 1 + ( 2 2 2 ) 1 0 1 8 × 2 2 0 × 2 2 + ⋯ + ( 2 0 2 2 ) 2 2 × 2 2 0 ] + 2 2 0 × 2 2 2 + 2 2 2 = 1 0 0 × C 2 + 2 2 1 × 2 2 2 = ( 0 2 2 ) 2 0 2 2 × 2 0 + ( 1 2 2 ) 2 0 2 1 × 2 1 + ( 2 2 2 ) 2 0 2 0 × 2 2 + ⋯ + ( 2 0 2 2 ) 2 0 2 × 2 2 0 + ( 2 1 2 2 ) 2 0 1 × 2 2 1 + ( 2 2 2 2 ) 2 0 0 × 2 2 2
Problem Loading...
Note Loading...
Set Loading...
Let's write all items of the summation:
1 1 1 1 = ( 1 0 + 1 ) 1 1 = 1 0 0 × C 1 + 1 1 1 × 1 1 1 2 2 2 2 = ( 2 0 + 2 ) 2 2 = 1 0 0 × C 2 + 2 2 1 × 2 2 2 3 3 3 3 = ( 3 0 + 3 ) 3 3 = 1 0 0 × C 3 + 3 3 1 × 3 3 3 ⋮ ( 9 0 + 9 ) 9 9 = 1 0 0 × C 9 + 9 9 1 × 9 9 9
It's clear that 1 0 0 × C 1 , 1 0 0 × C 2 , 1 0 0 × C 3 , … , 1 0 0 × C 9 are divisible by 1 0 0 , so we just need to find the reminder of 1 1 1 × 1 1 1 , 2 2 1 × 2 2 2 , 3 3 1 × 3 3 3 , … , 9 9 1 × 9 9 9 ( m o d 1 0 0 ) .
By using Euler's theorem, CRT, and the properties of modular arithmetic we will find that
2 2 2 ≡ 4 ( m o d 1 0 0 ) 3 3 3 ≡ 2 3 ( m o d 1 0 0 ) 4 4 4 ≡ 5 6 ( m o d 1 0 0 ) 5 5 5 ≡ 2 5 ( m o d 1 0 0 ) 6 6 6 ≡ 5 6 ( m o d 1 0 0 ) 7 7 7 ≡ 7 ( m o d 1 0 0 ) 8 8 8 ≡ 1 6 ( m o d 1 0 0 ) 9 9 9 ≡ 8 9 ( m o d 1 0 0 )
Now, we have
1 1 × 1 + 2 1 × 4 + 3 1 × 2 3 + 4 1 × 5 6 + 5 1 × 2 5 + 6 1 × 5 6 + 7 1 × 7 + 8 1 × 1 6 + 9 1 × 8 9 ≡ 1 1 + 8 4 + 1 3 + 9 6 + 7 5 + 1 6 + 9 7 + 9 6 + 9 9 ≡ 5 8 7 ≡ 8 7 ( m o d 1 0 0 )