Search Results for ""

Let there be x successes out of n Bernoulli trials. The sample proportion is the fraction of samples which were successes, so p^^=x/n. (1) For large n, p^^ has an ...

If f(x)=f_0+f_1x+f_2x^2+...+f_nx^n+..., (1) then S(n,j)=f_jx^j+f_(j+n)x^(j+n)+f_(j+2n)x^(j+2n)+... (2) is given by S(n,j)=1/nsum_(t=0)^(n-1)w^(-jt)f(w^tx), (3) where ...

The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...

There are (at least) two equations known as Sommerfeld's formula. The first is J_nu(z)=1/(2pi)int_(-eta+iinfty)^(2pi-eta+iinfty)e^(izcost)e^(inu(t-pi/2))dt, where J_nu(z) is ...

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 ...

The "kurtosis excess" (Kenney and Keeping 1951, p. 27) is defined in terms of the usual kurtosis by gamma_2 = beta_2-3 (1) = (mu_4)/(mu_2^2)-3. (2) It is commonly denoted ...

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 ...