If n is a natural number, find the remainder when 3 7 n + 2 + 1 6 n + 1 + 3 0 n is divided by 7.
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.
Just for the sake of MCQ, it is better to substitute n=1 and solve.
Log in to reply
Or even better is just 0
Yeah.. you're right. Thanks!
Nt say
3 7 n + 2 + 1 6 n + 1 + 3 0 n ≡ 2 n + 2 + 2 n + 1 + 2 n = 2 n ( 4 + 2 + 1 ) = 2 n × 7 ≡ 0 ( m o d 7 )
Here a ≡ b ( m o d c ) means a leaves same reminder as b when divided by c.
Same way buddy
Yeah , evwn i did the same
Problem Loading...
Note Loading...
Set Loading...
3 7 n + 2 + 1 6 n + 1 + 3 0 n
= ( 3 5 + 2 ) n + 2 + ( 1 4 + 2 ) n + 1 + ( 2 8 + 2 ) n
In the binomial expansion of each of the above terms, all but the last terms are multiples of 7. So we only need to check divisibility of the last terms of each of the expansions. The last terms are:
= ( n + 2 n + 2 ) 2 n + 2 + ( n + 1 n + 1 ) 2 n + 1 + ( n n ) 2 n
= 2 n + 2 + 2 n + 1 + 2 n
= 2 n × ( 2 2 + 2 1 + 2 0 )
= 2 n × 7
Hence, the sum of the these is also a multiple of 7. So the remainder when the given expression is divided by 7 is 0 .