TOPICS
Search

Search Results for ""


2751 - 2760 of 4217 for Strong Lawof Small NumbersSearch Results
Due to Euler's prolific output, there are a great number of theorems that are know by the name "Euler's theorem." A sampling of these are Euler's displacement theorem for ...
The w-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. Setting f_n(1)=f_n (1) give a Fermat-Lucas number. The first few Fermat-Lucas ...
A continuous real function L(x,y) defined on the tangent bundle T(M) of an n-dimensional smooth manifold M is said to be a Finsler metric if 1. L(x,y) is differentiable at ...
By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...
A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...
The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...
The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...
Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...
The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...
A free Abelian group is a group G with a subset which generates the group G with the only relation being ab=ba. That is, it has no group torsion. All such groups are a direct ...
1 ... 273|274|275|276|277|278|279 ... 422 Previous Next

...