MATH
posted by heather .
Given that logbase2 a+logbase2 b=3 , calculate all the possible integer values of a if b is
also an integer value. Explain your reasoning.

log_{2} a + log_{2} b = 3
log_{2} (ab) = 3
ab = 2^3 = 8
using positive integer values, all possibilties for
(a,b) are
(1,8)
(2,4)
(4,2) and
(8,1)
testing one of them: a=4, b=2
LS = log_{2}4 +log_{2} 2
= 2 + 1
= 3
= RS
Respond to this Question
Similar Questions

Math
x^2+xk find all positive values for k, if it can be factored Allowed values of k for for the expression to be factorable with integers are a*(a+1) where a is an integer equal to 1 or more. For example: 2, 6, 12, 20... The factors … 
Math
One integer is 4 more than a second integer. Three times the first integer when added to two times the second integer is less than 23. Determine the largest possible values of the two integers. 
programming
I am supposed to modify this program so it begins by asking the user for the number of values. The program then uses a loop to read the specified number of values and then display their average. program is below that i worked on in … 
Trigonometry
Express each of the following as a single logarithmic expression. All exponents must be left in radical form: 1.) 2logx3logy 2.) logxlogy+logz 3.) 1/3log5x+2/3log6x 4.) 2/3(logbase2 x  logbase2 y) I don't understand these problems … 
maths
f(x) is a polynomial with integer coefficients and degree at most 10. There are N distinct integer values for which f(n)=2, and M distinct integer values for which f(m)=−2. What is the maximum possible value of NM? 
heeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
plsheeeeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
help maaaaath
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
heeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
MATH
For what value(s) of x does logbase2 (logbase3 (logbase4 x))=0