#Can someone please explain how to solve for m and n.
50 messages · Page 1 of 1 (latest)
,tex 2^{m-n} = 2^m \cdot 2^{-n}
But
x^{-n} = \frac{1}{x^n}
Hence,
2^{m-n} = 2^m \cdot 2^{-n} = 2 \cdot \frac{1}{2^n} = \frac{2^m}{2^n}
Gkratsia
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
I see thanks. So x^-n = 1/x^n always
That's right!
By definition, I would say... It's the negative exponent rules.
Although it is not a proof, you can check that for example:
$2^2\cdot 2^{-1} = 2^{2-1} = 2$
also
$2^2 \cdot 2^{-1} = 2^2 \cdot \frac{1}{2^1} = \frac{4}{2} = 2$
Gkratsia
I see. Thank you so much !
Makes a lot more sense now
Coming to your initial question:
$2^m = 2^n + 56 \Rightarrow 2^m - 2^n = 56$ for this to hold, m must be greater than n.
Gkratsia
You are welcome!
A first and naive approach would be the following
$2^m - 2^n = 64 - 8 = 2^6 - 2^3$, hence $m=6$ and $m=3$
Gkratsia
Take log base 2 of everything
Damn how did you assume the values of 2^m and 2^n?
But I think there is a better solution like boice said
I did, but then I got lost later on.
m = log2(2^n + 56)
something like this
$56 = 64 - 8 = 2^6 - 2^3$ I tried to find a combination of powers of two that would give me 56.
Gkratsia
Ohh shit that's smart
thanks though I've kind of solved it but I don't know how to write with latex
Is this problem underdefined?
But not always the correct way...
2^m = 2^n + 56
2^n(2^{m-n} - 1) = 8 x 7
2^n(2^{m-n} - 1) = 2^3(2^3-1)
m = 6, n = 3
what do you mean by underdefined?
this was my approach @ancient basin
Is there only one solution
Or is there more than one
It seems there is only one, but it's not always the case.
I like your approach better than mine
Use the dollar sign to make it latex
I don't know. This was the main question. We need to find values of m and n
$2^m = 2^n + 56$
$2^n(2^{m-n} - 1) = 8 \times 7$
$2^n(2^{m-n} - 1) = 2^3(2^3-1)$
$m = 6, n = 3$
I see, thanks!
Gkratsia
Yeah 1 equation two unknowns so if m and n could be non integers there are infinite solutions
damn alright, thanks though.
thanks for all the help
i'm closing this thread
.close