Search Results for ""
921 - 930 of 2617 for Prime Generating PolynomialSearch Results
The nth raw moment mu_n^' (i.e., moment about zero) of a distribution P(x) is defined by mu_n^'=<x^n>, (1) where <f(x)>={sumf(x)P(x) discrete distribution; intf(x)P(x)dx ...
Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
A polynomial form which is the sum of two polynomial forms involving separate sets of variables.
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
Abstract Algebra
A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...
If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
...
View search results from all Wolfram sites (24574 matches)

