Find the smallest positive integer n for which 3 2 n − 1 is divisible by 2 1 9 9 5 .
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.
can you plz elaborate what is LTE
I've got 1994 but I found my error. I didn't consider that 3 2 0 + 1 = 4 and has two times 2 as a factor, so I need to reduce one more from my answer.
using totient function, its n = 1994
We can observe a pattern ,
3 2 − 1 ⇒ divisible by 2 3 .
3 4 − 1 ⇒ divisible by 2 4 .
3 8 − 1 ⇒ divisible by 2 5 .
.
.
.
So 3 2 n − 1 ⇒ divisible by 2 n + 2 when n > 0 .
Now we are given that 3 2 n − 1 must be divisible by 2 1 9 9 5 .
⇒ n + 2 = 1 9 9 5
⇒ n = 1 9 9 3
Problem Loading...
Note Loading...
Set Loading...
3 2 n − 1 = 9 2 n − 1 − 1 Since 4 ∣ 9 − 1 using LTE lemma for p = 2 we get v 2 ( 9 2 n − 1 − 1 ) = v 2 ( 9 − 1 ) + v 2 ( 2 n − 1 ) = 3 + n − 1 = n + 2 Now we must have 1 9 9 5 ∣ n + 2 , smallest such positive integer is n = 1 9 9 3 .