TOPICS
Search

Search Results for ""


4691 - 4700 of 13134 for Graph TheorySearch Results
The nth Suzanne set S_n is defined as the set of composite numbers x for which n|S(x) and n|S_p(x), where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...
The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...
By analogy with the tanc function, define the tanhc function by tanhc(z)={(tanhz)/z for z!=0; 1 for z=0. (1) It has derivative (dtanhc(z))/(dz)=(sech^2z)/z-(tanhz)/(z^2). (2) ...
Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...
The "ternary" Champernowne constant can be defined by concatenating the ternary representations of the integers C_3 = 0.(1)(2)(1,0)(1,1)(1,2)(2,0)..._3 (1) = ...
The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...
Let G be a group having normal subgroups H and K with H subset= K. Then K/H⊴G/H and (G/H)/(K/H)=G/K, where N⊴G indicates that N is a normal subgroup of G and G=H indicates ...
1 ... 467|468|469|470|471|472|473 ... 1314 Previous Next

...