Search Results for ""
2131 - 2140 of 13134 for Extremal graph theorySearch Results
The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...
A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.
An operator Gamma=sum_(i=1)^me_i^Ru^(iR) on a representation R of a Lie algebra.
Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...
In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...
A chiral knot is a knot which is not capable of being continuously deformed into its own mirror image. A knot that can be so deformed is then called an amphichiral knot. ...
A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...
The cokernel of a group homomorphism f:A-->B of Abelian groups (modules, or abstract vector spaces) is the quotient group (quotient module or quotient space, respectively) ...
For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).
The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).
...
View search results from all Wolfram sites (34319 matches)

