sundialsvcs: i did, believe me! i just forgot these rules--did some searching on them before posting but couldnt quite get an example of the form above. i tried it again after seeing the above answers and could get it though.. makes perfect sense.
reverse and schatoor: thanks guys, i get it now.
so what you guys have above is that it expands to: 2^(a+1) * b + 2^a. if you factored out a 2 would it look like: 2[ 2^a * b + 2^(a-1) ] (which of course isnt much help).
reverse, since you asked, ill try and put here the original exercise. again, this is a course based on proofs.
as above, we are given a function f that takes two natural numbers (integers > 0) and sends it to a third natural number. it is defined as: f(a,b) = 2^a * (2b + 1)
what i had to prove for the particular question, was that this function is
injective. that is, take 4 natural numbers (a,b) and (c,d). assume that f(a,b) = f(c,d) is a true statement. what you have to prove for it to be injective, is that, (a,b) = (c,d) (that is, a = c and b = d).
so i came here looking on how to expand it to see if i could factor out variables, etc, because as you can see it will be pretty messy. i did end up being able to prove it earlier today (due to a different frame of mind) which i will now show, for those interested.
take a, b, c, d from N (again, set of natural numbers). _assume_ that f(a,b) = f(c,d). you have to now prove that a = c and b = d. lets proceed..
Code:
f(a,b) = f(c,d) ("is true")
2^a * (2b + 1) = 2^c * (2d + 1) [now add 2^(-a) to each side, keeping the equality true]
2^a * (2b + 1) + 2^-a = 2^c * (2d + 1) + 2^-a [add the exponents with same base, gives you:]
2^(a - a) * (2b + 1) = 2^(c - a) * (2d + 1)
2b + 1 = 2^(c - a) * (2d + 1)
after doing alot of these proofs in class, one will notice that the 2b + 1 is always odd, and 2^(any natural number) * (2d + 1) is always even, _unless_ 2 is raised to exponent 0. since the equality states that the left hand side is odd, the right hand side must be odd, and the only way that can happen is if 2^(c-a) = 1 = 2^(0). this means that c = a. now back to the equation:
Code:
2b + 1 = 2^0 * 2d + 1
2b + 1 = 1 * 2d + 1
2b + 1 = 2d + 1
2b = 2d
b = d
the proof is now complete.
thanks again to those interested, and sorry for the mess of a post.