Search Results for ""
961 - 970 of 5121 for Odd/even/prime/composite/square numbersSearch Results
The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...
Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...
The nth cabtaxi number is the smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes. The name derived from the taxicab ...
In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...
The Pontryagin number is defined in terms of the Pontryagin class of a manifold as follows. For any collection of Pontryagin classes such that their cup product has the same ...
The Stiefel-Whitney number is defined in terms of the Stiefel-Whitney class of a manifold as follows. For any collection of Stiefel-Whitney classes such that their cup ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...
Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...
Let a hotel have a denumerable set of rooms numbered 1, 2, 3, .... Then any finite number n of guests can be accommodated without evicting the current guests by moving the ...
...