Let 3 N be the highest power of 3 which divides 8 0 2 1 1 - 7 3 1 1 . What is N ?
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.
We use the Lifting the Exponent Lemma, and we get:
ord 3 ( 8 0 2 1 1 − 7 3 1 1 ) = ord 3 ( 8 0 2 − 7 3 ) = ord 3 ( 7 2 9 ) = 6 .
We know that x n - y n is divisible by x-y when n is odd.
We can prove this, but to reduce the step I had written directly.
Therefore 8 0 2 1 1 - 7 3 1 1 is divisible by 802-73=729
Since 3 6 is 729
Therefore the value of N is 6
hey you if N =0 ; then 1 also divides the given expression no give me reply you eli p
Log in to reply
what kind of Tamil words do you use ha? Do you think you are too great to use words like eli p?, that literally means rat's toilet. Firstly, say sorry to Vishal, and to Brilliant.org. If he had done something incorrectly, then you are meant to advise, not use these kinds of words like eli p.
Problem Loading...
Note Loading...
Set Loading...
a n − b n = ( a − b ) ( a n − 1 + a n − 2 b + a n − 3 b 2 + . . . . . . . . + a b n − 2 + b n − 1 )
Using this, 8 0 2 1 1 − 7 3 1 1 = ( 8 0 2 − 7 3 ) ( 8 0 2 1 0 + 8 0 2 9 7 3 + . . . . . . . . + 7 3 1 0 )
= 7 2 9 ( 8 0 2 1 0 + 8 0 2 9 7 3 + . . . . . . . . + 7 3 1 0 ) = 3 6 ( 8 0 2 1 0 + 8 0 2 9 7 3 + . . . . . . . . + 7 3 1 0 )
So N is at least 6 . Now since we need to find out the number of factors of 3 in the second expression,we at first check if 3 ∣ ( 8 0 2 1 0 + 8 0 2 9 7 3 + . . . . . . . . + 7 3 1 0 ) . Since 8 0 2 ≡ 1 ( m o d 3 ) 7 3 ≡ 1 ( m o d 3 ) we can conclude easily that ( 8 0 2 1 0 + 8 0 2 9 7 3 + . . . . . . . . + 7 3 1 0 ) ≡ 1 1 ≡ 2 ( m o d 3 ) and hence is not divisible by 3 .
So we conclude that N = 6