Assuming the definition of 'Closed Form' given in the table of: Closed Form Wikipedia entry, what areas tend to have problems that are traditionally expressed in closed form?
EDIT: Given the comment below about only 'easy' problems having closed form solutions, does this change if analytic closed forms are considered?
Closed-form solutions are the exception rather than the rule. They are droplets in an ocean of intractable computations.
In the frame of algebra/calculus, we have
Linear equations and systems of equations: yes, always (fortunately).
Algebraic equations and systems of equations: no (with a few exceptions, like second, third and fourth degree).
Transcendental equations: no.
Derivatives: yes, always.
Antiderivatives and summations: no (with exceptions such as rational fractions).
Definite integrals: no (a few dozen cases solved without antiderivatives are known).
Integral transforms (such as Laplace or Fourier): no (tables count a few dozen entries).
Linear differential equations and linear recurrences with constant coefficients: yes (but for the roots of the characteristic equation).
Linear or nonlinear differential equations: no.
Partial differential equations: no.
(When I say no, that means in general; closed-form cases do exist, but AFAIK they are sporadic and there is no easy way to characterize them.)
If you allow infinite sequences/series, presumably all these problems can be solved, by invoking numerical methods. At least in theory.
My definition of closed-form allows change of sign, addition, logarithm, exponential and function composition in the complex numbers. (Indirectly, subtraction, multiplication, division, exponentiation, polynomials, rational fractions, trigonometric and hyperbolic functions and their inverses.) This coincides with the Wikipedia entry, with the exception of the factorial.