TOPICS
Search

Search Results for ""


2741 - 2750 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...
Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...
Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...
The vector triple product identity is also known as the BAC-CAB identity, and can be written in the form Ax(BxC) = B(A·C)-C(A·B) (1) (AxB)xC = -Cx(AxB) (2) = -A(B·C)+B(A·C). ...
A d-repdigit is a number composed of repetition of a single digit (in a given base, generally taken as base 10 unless otherwise specified). For example, the beast number 666 ...
The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...
A benzenoid is a fusene that is a subgraph of the regular hexagonal lattice (i.e., a simply connected polyhex). The numbers of n-hexagon benzenoids for n=1, 2, ... are 1, 1, ...
An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...
A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...
Gauss's forward formula is f_p=f_0+pdelta_(1/2)+G_2delta_0^2+G_3delta_(1/2)^3+G_4delta_0^4+G_5delta_(1/2)^5+..., (1) for p in [0,1], where delta is the central difference and ...
1 ... 272|273|274|275|276|277|278 ... 937 Previous Next

...