3 + 3 2 + 3 3 + 3 4 + 3 5 + … . + 3 1 0 4 is divisible 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.
A brute force way to demonstrate this is simply by factorizing a bit as follows:
3 + 3 2 + 3 3 + 3 4 + … + 3 1 0 4 = 3 ( 1 + 3 ) + 3 3 ( 1 + 3 ) + … + 3 1 0 3 ( 1 + 3 ) = 4 ( 3 1 + 3 3 + 3 5 + 3 7 + 3 9 + … + 3 1 0 1 + 3 1 0 3 ) = 4 ( 3 1 ( 1 + 9 ) + 3 5 ( 1 + 9 ) + … + 3 1 0 1 ( 1 + 9 ) ) = 4 × 1 0 × ( 3 1 + 3 5 + … + 3 1 0 1 )
It is obvious that the expression inside the brackets is a whole number and we have 4 and 1 0 as factors of the original expression. This trivially implies that the expression is divisible by 2 and 5 .
The reason for the expression being divisible by 1 and 3 is the same as you provided in your solution.
In second case , it should be proved that S is divisible by 4 because if it is only divisible by 2 , then the 2 in the denominator will cancel it off.
Good Solution sir
Sir, in divisibility by 5 , why is it congruent to 1 ( m o d 5 ) and not − 1 ( m o d 5 )
Problem Loading...
Note Loading...
Set Loading...
Let S = 3 + 3 2 + 3 3 + 3 4 + 3 5 + . . . = 3 ( 1 + 3 + 3 2 + 3 3 + 3 4 + . . . ) = 3 − 1 3 ( 3 1 0 4 − 1 ) = 2 3 ( 3 1 0 4 − 1 )
Therefore, 3 + 3 2 + 3 3 + 3 4 + 3 5 + . . . is divisible by 1, 2, 3 and 5 .