Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Sometimes I have a really huge expression that cannot be significantly simplified by FullSimplify. I would like to, so to speak, "simplify with faith" using heuristics applied by functions like PossibleZeroQ, FindSequenceFunction an so on. Is it possible to instruct FullSimplify to use non-rigorous methods like this?

share|improve this question
up vote 15 down vote accepted

Sometimes I use the following:

  1 + Sqrt[2] Log[2] - Sqrt[3] Log[3] - Sqrt[5] Log[5] + 
  Sqrt[2 (9 + 4 Sqrt[2]) Log[2]^2 + 3 Log[3]^2 - 2 Log[2] (Sqrt[3] (4 + Sqrt[2]) Log[3] +
  4 Sqrt[5] Log[5]) + Log[5] (-Sqrt[10] Log[4] + 5 Log[5] + Sqrt[15] Log[9])] + Log[16], 
    TransformationFunctions -> {Automatic, 
      If[Not[AtomQ[#]] && NumericQ[#] && PossibleZeroQ[# - Round[#]], Round[#], #] &}]

It helps to get a conjectured simple representation of an expression, which then I can try to prove rigorously.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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