Question

suppose b is N, then 12(b^2) might have how many 3's in it's prime factorization

Answer 1

how many 3s are in 12?

Answer 2

if b has no 3s, then at least the number of 3s in 12

if b has 'k' 3s in it, then add in 2k

Answer 3

for example:

(4.3) (3.3.2)^2
1 2

(4.3) (3.3.2) (3.3.2)
1 2 2
the squareing doubles the number of 3s in b

Answer 4

ok, I have some valid options: 2, 7 or 12

Answer 5

since the resctriction to b is N I think it could have infinite 3's