TOPICS
Search

Search Results for ""


3791 - 3800 of 13134 for Extremal graph theorySearch Results
The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...
A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...
If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...
A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...
Let a divisor d of n be called a 1-ary (or unitary) divisor if d_|_n/d (i.e., d is relatively prime to n/d). Then d is called a k-ary divisor of n, written d|_kn, if the ...
Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...
A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...
A von Neumann regular ring is a ring R such that for all a in R, there exists a b in R satisfying a=aba (Jacobson 1989, p. 196). More formally, a ring R is regular in the ...
A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...
The conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...
1 ... 377|378|379|380|381|382|383 ... 1314 Previous Next

...