Search Results for ""

A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.

The zero product property asserts that, for elements a and b, ab=0=>a=0 or b=0. This property is especially relevant when considering algebraic structures because, e.g., ...

pi has decimal expansion given by pi=3.141592653589793238462643383279502884197... (1) (OEIS A000796). The following table summarizes some record computations of the digits of ...

Comprehensive encyclopedia of mathematics with 13,000 detailed entries. Continually updated, extensively illustrated, and with interactive examples.

Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...

The elliptic modulus k is a quantity used in elliptic integrals and elliptic functions defined to be k=sqrt(m), where m is the parameter. An elliptic integral is written ...

There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The variable phi (also denoted am(u,k)) used in elliptic functions and elliptic integrals is called the amplitude (or Jacobi amplitude). It can be defined by phi = am(u,k) ...

The lemniscate functions arise in rectifying the arc length of the lemniscate. The lemniscate functions were first studied by Jakob Bernoulli and Giulio Fagnano. A historical ...