Search Results for ""

If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...

There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...