TOPICS
Search

Search Results for ""


1971 - 1980 of 2617 for Prime Generating PolynomialSearch Results
R(p,tau)=int_(-infty)^inftyint_(-infty)^inftyf(x,y)delta[y-(tau+px)]dydx, (1) where f(x,y)={1 for x,y in [-a,a]; 0 otherwise (2) and ...
Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...
Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...
Let a sequence be defined by A_(-1) = s (1) A_0 = 3 (2) A_1 = r (3) A_n = rA_(n-1)-sA_(n-2)+A_(n-3). (4) Also define the associated polynomial f(x)=x^3-rx^2+sx+1, (5) and let ...
The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...
The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...
The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...
Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...
If the sides of a triangle are divided in the ratios lambda:1, mu:1, and nu:1, the cevians form a central triangle whose area is ...
1 ... 195|196|197|198|199|200|201 ... 262 Previous Next

...