Search Results for ""
1171 - 1180 of 2456 for Wedderburns Little TheoremSearch Results
The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...
The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...
The fish graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["FishGraph"].
n Sloane's 2^n 3^n 4^n 5^n 6^n 7^n 8^n 9^n 1 A000027 2 3 4 5 6 7 8 9 2 A002993 4 9 1 2 3 4 6 8 3 A002994 8 2 6 1 2 3 5 7 4 A097408 1 8 2 6 1 2 4 6 5 A097409 3 2 1 3 7 1 3 5 6 ...
A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...
The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...
The symbol O(x), pronounced "big-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n is ...
A game played with two dice. If the total is 7 or 11 (a "natural"), the thrower wins and retains the dice for another throw. If the total is 2, 3, or 12 ("craps"), the ...
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...
...
View search results from all Wolfram sites (13478 matches)

