\(72=2^3*3^2\), so we have that 2^3 is a divisor of 72 and 2^4 is not. Thus 2^3||72, hence k=3.

Answer: B.
_________________

Initially looking to the problem one may try to plugin the numbers one by one. Here, 2^2=4 is a divisor of 72 and 2^3=8 is also a divisor of 72. But, we have to choose only one answer.
72=2x2x2x3x3=2^3 *3^2 and it is given that 72/2^k = integer. Here, we can equate 2^3=2^k and hence k=3. But, in fact 2^2 is also a divisor of 72 hence 2 could also be the answer. But, since it is additionally given that k+1 is not a divisor i.e. 2 in this case does not satisfy the condition because 2+1=3 and 2^3 is a divisior of 72. where as 3 satisfies the condition i.e. 3+1= 4 turning into 2^4 which is not a divisor of 72. This is how only one answer choice is left which is equal to 3 = answer choice B.

Ans:

72= 2^3x3^2, since 2^3 is a divisor of 72 k can be 3. Also 2^4=(2^(k+1)) is not a divisor of 72 , therefore the answer is (B).

2^k has to be a factor of 72.

Factors of 72: 3^2 x 2^3

Hence, k = 3.

Answer B.

Prime factorization is also helpful to solve this problem. For ME it´s faster..

Probably it helps someone.

72 = 2*2*2*3*3

72/ 2^k = int ; 72/2^k+1 not integer

if k= 2 then divisible ,k=3 then also ..
if K=3 then divisible , k=4 then not..

Answer =B

If we say that 2^k is a divisor of 72 could we also do this to solve the problem?

Do the prime factorization of 72: 2^3 * 3^3, and then create the following equation:

2^k * 3^3 = 2^3 * 3^3, so k = 3?

Then we are assuming that k is 72, but 72 is still a divisor of 72. So, could we also do that?

As I see it, it is just a more visual way to say what everyone said above. Right...?

Why is the answer not A? if k= 2 it is still a divisor of 72

We need such k that 2^k IS a divisor of 72 but 2^(k+1) is NOT. k cannot be 2 because 2^(2+1) IS a divisor of 72.
_________________

Thanks Bunuel for your prompt reply.

Great Question..
Here only K=3 satisfies the condition such that 8 divides 72 and 16 does not
Hence B
_________________

Solution:

This is called a "defined function" problem. The parallel lines mean intrinsically nothing, except to establish a relationship between a^k and b.We are given that a^k || b means:

1) b/a^k = integer

2) b/a^(k+1) ≠ integer

Next we are given specific numbers 2^k || 72, and we must use the pattern to determine k, using a = 2 and b = 72; thus, we know:

72/2^k = integer AND 72/2^(k+1) ≠ integer

In order for 72/2^k = integer AND 72/2^(k+1) ≠ integer to be true, k must equal 3. If have trouble seeing how this works, we can plug 3 back in to prove it.

When k = 3, we know:

1) 72/2^3 = 72/8 = 9, which IS an integer.

AND

2) 72/2^(3+1) = 72/2^4 = 72/16 = 4 1/2, which is NOT an integer.

The answer is B.
_________________

2^k ||72 means 2^k is a divisor of 72, but 2^(k+1) is not a divisor of 72

72 = 2^3*3^2

The maximum powers of 2 in 72 = 3
Hence 2^3 is a divisor of 72 and 2^4 is not a divisor of 72
k = 3

Correct Option: B

the formula says that 72 is devisible by 2^k, but not by 2^(k+1)
so, let's factor 72, 2^3 * 3^2, k is 3
Answer is B

The main point is what if the power of 2 in the integer 72?

Factorize 72
72=2^3*3^2

Just concerned with 2. The answer (thus) is 3.

Great job with tags here!

Can someone please explain what || means? It looks like absolute value, but I though absolute value only applied when you actually put something in between the bars?

From answer choice,
If k=3
72 is divisible by 2^3=8
When, 2^k+1=2^4=16 then 72/16 is not divisible.

According to condition

Answer is B

Posted from my mobile device

Because we have another condition that 2^k+1 is not a divisor of 72.
So, if we consider option A then, it'll be 2^2+1=8 by which 72 is possible to divide.

So option A is ignored ☺

Posted from my mobile device