#when is this divisible by 3?
82 messages · Page 1 of 1 (latest)
notice that 3 divides 2^(a+2b)-2^a - 3, if and only if, 3 divides 2^(a+2b)-2^a
simplifying this, 2^(a+2b)-2^a = 2^a(4^b-1)
3 doesnt divide 2^a, but taking a look to 4^b -1
we notice that the remainder of 4 when it is divided by 3 is 1
so it happens the same with 4^b
as we have 4^b - 1, then it is a multiple of 3
which means that 2^(a+2b)-2^a - 3 is a multiple of 3
wait wait
can you explain this in more detail please?
sure
as a consequence of the properties of the exponential function, we have:
2^(a+2b) = 2^a * 2^(2b)
and 2^(2b) = (2^2)^b = 4^b
now, by the distributive property, we have:
2^a * 4^b - 2^a = 2^a(4^b - 1)
no one needs to know...
its ok, cor
never
notice how you divided it all by 2^a and 3 isnt divisible by that, you were working with rational division, and we are talking about integer one
but its good to remark to learn
btw, bribe
we have seen that 3 divides it for all a and b naturals
if we divide by 3, we have
2^a(4^b - 1)/3 - 1
if its divisible by 9 (the original number), this would have to be divisible by 3, obviously
so
if 3 divides the whole thing
as it doesnt divide -1, it cant divide 2^a(4^b - 1)/3
2^a(4^b - 1)/3 would need to be 1 mod 3
maybe studying cases you reach the result
wait wdym
no the rational division
you wrote 3/2^a before
yep
that isnt an integer unless a = 0
yep
so it didnt make sense here was we are working with integer division
oh ye if there wasnt a 3 at the botton it would have worked
under the perspective of rational numbers, each rationaal number distinct of 0 has inverse regards the product, it is a field, so you can divide by any number distinct of 0 there
um bruh...
more clearly, when you took the common factor 2^a
as we are in (Z, +, *), and 2^a isnt a divisor of 3, you cant extract it from the whole expression
@dusty cedar another important thing is the following
but i didnt see the 3 as the denominator
{2^a mod 3 : a is natural is finite}
in fact, it follows a cycle
2 mod 3 is 2
2^2 mod 3 is 1
2^3 mod 3 is 2
2^4 mod 3 is 1
etc
and 4^b mod 3 is 1 for all natural b
are you just saying what you have proved but more rigorous
well, this is an observation
the rest is result of basic properties of algebra
can be proven by induction
split cases for a is even and a is odd
this doesnt make sense
it does
imagine we have a + b
and its divided by c
imagine b isnt divided by c but a was
oh is this after its been divided by 3?
then a + b = m * c and a = n c so:
m * c = n * c + b
and b = c(m-n)
we are having a mathematical discussion
Post marked as solved by @dusty cedar.
Use .unsolved if this was a mistake.
so c divides b
xDD
@manic crest i have just proved my reasoning on that step
ok ill look at it tmrrw when im less tired
@dusty cedar
study it but, if im correct, if a is odd, b needs to be 3 * n + 2 with n natural
and if a is even, b needs to be 3 * n + 1 with n natural
yw
what i did was, after proving that it was divisible by 3, i divided it by 3, then i worked with mod 3 again and by cases, taking advantage that despite there are 2 factors with powers, their modulo follows a cyclical sequence
2^a(4^b - 1)/3 - 1 = 0 mod 3, so 2^a(4^b - 1)/3 = 1 mod 3
meaning that 2^a is the inverse of (4^b - 1)/3 in Z_3
if a is odd, 2^a = 2 mod 3
so (4^b - 1)/3 needs to be 2 mod 3 too
as the inverse is unique
if a is even, 2^a = 1 mod 3
so (4^b - 1)/3 needs to be 1 mod 3 too