Search Results for ""

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

The integral int_0^thetae^(-xsecphi)dphi.

The property intf(y)delta(x-y)dy=f(x) obeyed by the delta function delta(x).

A family composed of countably many discrete families.

A family composed of countably many locally finite families.

The signed deviation is defined by Deltau_i=(u_i-u^_), so the average deviation is Deltau^_=u_i-u^_^_=u_i^_-u^_=0.

A test for determining the probability that a given result could not have occurred by chance (its significance).

The 6-polyiamond illustrated above.

sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...