Search Results for ""
1511 - 1520 of 2487 for Prime SumsSearch Results
The bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...
A Tschirnhausen transformation can be used to algebraically transform a general quintic equation to the form z^5+c_1z+c_0=0. (1) In practice, the general quintic is first ...
Let p_n/q_n be the sequence of convergents of the continued fraction of a number alpha. Then a Brjuno number is an irrational number such that ...
Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...
Given any triangle ABC, the signed sum of perpendicular distances from the circumcenter O to the sides (i.e., signed lengths of the pedal lines from O) is OO_A+OO_B+OO_C=R+r, ...
In affine three-space the Cayley surface is given by x_3=x_1x_2-1/3x_1^3 (1) (Nomizu and Sasaki 1994). The surface has been generalized by Eastwood and Ezhov (2000) to ...
A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...
A moment mu_n of a univariate probability density function P(x) taken about the mean mu=mu_1^', mu_n = <(x-<x>)^n> (1) = int(x-mu)^nP(x)dx, (2) where <X> denotes the ...
A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...
A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...
...
View search results from all Wolfram sites (13197 matches)

