Widget Basics (GUIKit Package Tutorial)

Widgets are the basic component of GUIs built with GUIKit. This tutorial discusses some of the basics of widgets and how they work. More detailed information on widgets can ...

Analysis of Variance Package (ANOVA Package Tutorial)

This package provides functions for performing a univariate Analysis of Variance (ANOVA) to examine the differences between groups of means. The function ANOVA can handle ...

DaysPlus (Calendar Package Symbol)

DaysPlus[{year, month, day}, n] gives the date n days after the date {year, month, day}.DaysPlus[{year, month, day, hour, minute, second}, n] gives the date n days after the ...

FourierSeries` (Mathematica Compatibility Information)

FourierSeries, FourierTrigSeries, and FourierCoefficient are part of the Mathematica kernel. FourierSinCoefficient and FourierCosCoefficient are now in the built-in ...

Graphics`Graphics` (Mathematica Compatibility Information)

LogPlot, ListLogPlot, and related functions have been added to the built-in Mathematica kernel. PolarPlot and ListPolarPlot have been added to the built-in Mathematica ...

NumberTheory`NumberTheoryFunctions` (Mathematica Compatibility Information)

SquareFreeQ, PrimePowerQ, KroneckerSymbol, ChineseRemainder and PrimitiveRoot have been added to the built-in Mathematica kernel functions. NextPrime and PreviousPrime are ...

Fourier Series Package (Fourier Series Package Tutorial)

The Mathematica kernel provides the functions FourierTransform and InverseFourierTransform for computing the symbolic Fourier exponential transform and inverse transform. It ...

ExpressionTreePlot (Graph Utilities Package Symbol)

ExpressionTree[e] plots the expression tree of e.ExpressionTreePlot[e, pos] plots the expression tree of e with its root placed at position pos.ExpressionTreePlot[e, pos, ...

FindHamiltonianCycle (Graph Utilities Package Symbol)

FindHamiltonianCycle[g] attempts to find a Hamiltonian cycle.

GraphDistanceMatrix (Graph Utilities Package Symbol)

GraphDistanceMatrix[g] gives a matrix in which the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j.GraphDistanceMatrix[g, Parent] ...