Search Results for ""
5381 - 5390 of 8565 for L 1 NormSearch Results
Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...
Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...
A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...
A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...
A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...
The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...
Finding the height above the bottom of a horizontal cylinder (such as a cylindrical gas tank) to which the it must be filled for it to be one quarter full amounts to plugging ...
A quaternion Kähler manifold is a Riemannian manifold of dimension 4n, n>=2, whose holonomy is, up to conjugacy, a subgroup of Sp(n)Sp(1)=Sp(n)×Sp(1)/Z_2, but is not a ...
If the knot K is the boundary K=f(S^1) of a singular disk f:D->S^3 which has the property that each self-intersecting component is an arc A subset f(D^2) for which f^(-1)(A) ...
The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...
...
View search results from all Wolfram sites (502043 matches)

