Given a list of numbers each containing 2 prime factors, I wish to make a list of the products of the logs of each factor. For example, given

L = {4,6,9}, I would like to form P = {Log[2]*Log[2],Log[2]*Log[3],Log[3]*Log[3]}.

FactorInteger seems like a questionable route since it would require some work to distinguish squares from numbers with two distinct prime factors.

Any suggestions? Thank you.

  • $\begingroup$ Warning: Trying to force Mma to display its results in the way you like them is usually difficult and doesn't pay off $\endgroup$ Jun 13, 2013 at 16:47
  • $\begingroup$ @belisarius: If you are suggesting that the best way might be a short program then I can accept that. $\endgroup$
    – daniel
    Jun 13, 2013 at 16:56
  • $\begingroup$ I do not see how this can be done without, in effect, factoring the number. $\endgroup$ Jun 13, 2013 at 18:24
  • $\begingroup$ @DanielLichtblau: No, that has to be done. $\endgroup$
    – daniel
    Jun 14, 2013 at 0:48

1 Answer 1


You could try a couple of rules, but the heads of the elements in the output list will mix Times and HoldForm...

Map[FactorInteger,{4,6,9,15,25,33,49,51}] /.
  • 1
    $\begingroup$ Alternatively: {4, 6, 9, 15, 25, 33, 49, 51} /. n_Integer /; PrimeOmega[n] == 2 :> Times @@ Log[Flatten[ConstantArray @@@ FactorInteger[n]]] $\endgroup$ Jun 13, 2013 at 18:23
  • $\begingroup$ Actually this was better than what I had anticipated, thanks. $\endgroup$
    – daniel
    Jun 13, 2013 at 23:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.