Search Results for ""
1071 - 1080 of 2464 for Graph powerSearch Results
Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...
Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...
The Bernoulli inequality states (1+x)^n>1+nx, (1) where x>-1!=0 is a real number and n>1 an integer. This inequality can be proven by taking a Maclaurin series of (1+x)^n, ...
The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...
A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...
Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...
Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...
The even part Ev(n) of a positive integer n is defined by Ev(n)=2^(b(n)), where b(n) is the exponent of the exact power of 2 dividing n. The values for n=1, 2, ..., are 1, 2, ...
There are two important theorems known as Herbrand's theorem. The first arises in ring theory. Let an ideal class be in A if it contains an ideal whose lth power is ...
A relation expressing a sum potentially involving binomial coefficients, factorials, rational functions, and power functions in terms of a simple result. Thanks to results by ...
...
View search results from all Wolfram sites (331480 matches)

