Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient-based methods use first ...
Tan
(Built-in Mathematica Symbol) Tan[z] gives the tangent of z.
I
(Built-in Mathematica Symbol) I represents the imaginary unit Sqrt[-1].
This package implements primality proving. If ProvablePrimeQ[n] returns True, then the number n can be mathematically proven to be prime. In addition, PrimeQCertificate[n] ...
Sec
(Built-in Mathematica Symbol) Sec[z] gives the secant of z.
LibraryFunctionUnload[fun] unloads a LibraryFunction so that it cannot be used.
CoprimeQ[n_1, n_2] yields True if n_1 and n_2 are relatively prime, and yields False otherwise. CoprimeQ[n_1, n_2, ...] yields True if all pairs of the n_i are relatively ...
Divisible[n, m] yields True if n is divisible by m, and yields False if it is not.
EulerPhi[n] gives the Euler totient function \[Phi](n).
LinebreakAdjustments is an option for selections that sets parameters used for calculating where automatic line breaks should be inserted.