TOPICS
Search

Search Results for ""


3411 - 3420 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The Herschel nonahedron is a canonical polyhedron whose skeleton is the Herschel graph. It has 11 vertices, 18 edges, and 9 faces. Of the edges, 6 are short and 12 are long. ...
The point S^' which makes the perimeters of the triangles DeltaBS^'C, DeltaCS^'A, and DeltaAS^'B equal. The isoperimetric point exists iff a+b+c>4R+r, (1) where a, b, and c ...
In conical coordinates, Laplace's equation can be written ...
The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...
A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...
A monotonic matrix of order n is an n×n matrix in which every element is either 0 or contains a number from the set {1,...,n} subject to the conditions 1. The filled-in ...
A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...
A polygonal number of the form N_n=n(7n-5)/2, also called an enneagonal number. The first few are 1, 9, 24, 46, 75, 111, 154, 204, ... (OEIS A001106). The generating function ...
The orthographic projection is a projection from infinity that preserves neither area nor angle. It is given by x = cosphisin(lambda-lambda_0) (1) y = ...
A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...
1 ... 339|340|341|342|343|344|345 ... 937 Previous Next

...