Search Results for ""

Orthogonal polynomials associated with weighting function w(x) = pi^(-1/2)kexp(-k^2ln^2x) (1) = pi^(-1/2)kx^(-k^2lnx) (2) for x in (0,infty) and k>0. Defining ...

Trigonometric functions of pi/p for p prime have an especially complicated Galois-minimal representation. In particular, the case cos(pi/23) requires approximately 500 MB of ...

A "visual representation" number which is a sum of some simple function of its digits. For example, 1233 = 12^2+33^2 (1) 2661653 = 1653^2-266^2 (2) 221859 = 22^3+18^3+59^3 ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...

Let E_n(f) be the error of the best uniform approximation to a real function f(x) on the interval [-1,1] by real polynomials of degree at most n. If alpha(x)=|x|, (1) then ...

A moment mu_n of a univariate probability density function P(x) taken about the mean mu=mu_1^', mu_n = <(x-<x>)^n> (1) = int(x-mu)^nP(x)dx, (2) where <X> denotes the ...

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

The Hénon-Heiles equation is a nonlinear nonintegrable Hamiltonian system with x^.. = -(partialV)/(partialx) (1) y^.. = -(partialV)/(partialy), (2) where the potential energy ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...