Piecewise[{{val_1, cond_1}, {val_2, cond_2}, ...}] represents a piecewise function with values val_i in the regions defined by the conditions cond_i. Piecewise[{{val_1, ...

Simplify[expr] performs a sequence of algebraic and other transformations on expr, and returns the simplest form it finds. Simplify[expr, assum] does simplification using ...

NMinimize, NMaximize, Minimize, and Maximize employ global optimization algorithms, and are thus suitable when a global optimum is needed. Minimize and Maximize can find ...

Together[expr] puts terms in a sum over a common denominator, and cancels factors in the result.

TrigReduce[expr] rewrites products and powers of trigonometric functions in expr in terms of trigonometric functions with combined arguments.

Constrained optimization problems are problems for which a function f(x) is to be minimized or maximized subject to constraints Φ(x). Here f:^n  is called the objective ...

A Diophantine polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers where the variables ...

A real polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers and

Google.com is a well-known web search engine. Google has made a web service available that allows developers to interface with their search engine within their own ...

Mathematica normally makes as few assumptions as possible about the objects you ask it to manipulate. This means that the results it gives are as general as possible. But ...