Search Results for ""

The pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...

A group that coincides with its commutator subgroup. If G is a non-Abelian group, its commutator subgroup is a normal subgroup other than the trivial group. It follows that ...

Petersson considered the absolutely converging Dirichlet L-series phi(s)=product_(p)1/(1-c(p)p^(-s)+p^(2k-1)p^(-2s)). (1) Writing the denominator as ...

Polynomials P_k(x) which form the Sheffer sequence for g(t) = (2t)/(e^t-1) (1) f(t) = (e^t-1)/(e^t+1) (2) and have generating function ...

Write the exact powers of 2 and 3 in sorted order as 1, 2, 3, 4, 8, 9, 16, 27, 32, ... (OEIS A006899), and let u_n be the nth term in the sequence. Then u_(n+1)-u_n tends to ...

Consider an n-dimensional deterministic dynamical system x^_^.=f^_(x) and let S be an n-1-dimensional surface of section that is traverse to the flow, i.e., all trajectories ...

Given a plane ax+by+cz+d=0 (1) and a point x_0=(x_0,y_0,z_0), the normal vector to the plane is given by v=[a; b; c], (2) and a vector from the plane to the point is given by ...

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...