TOPICS
Search

Search Results for ""


651 - 660 of 1366 for fibonacci seriesSearch Results
Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...
The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...
The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...
Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
The confluent hypergeometric function of the second kind gives the second linearly independent solution to the confluent hypergeometric differential equation. It is also ...
The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...
Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...
The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...
The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...
1 ... 63|64|65|66|67|68|69 ... 137 Previous Next

...