Search Results for ""
461 - 470 of 9384 for Numbered Equation 1Search Results
An n-persistent number is a positive integer k which contains the digits 0, 1, ..., 9 (i.e., is a pandigital number), and for which 2k, ..., nk also share this property. No ...
Let z=re^(itheta)=x+iy be a complex number, then inequality |(zexp(sqrt(1-z^2)))/(1+sqrt(1-z^2))|<=1 (1) holds in the lens-shaped region illustrated above. Written explicitly ...
A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...
Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...
The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...
The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...
The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...
Let A_(k,i)(n) denote the number of partitions into n parts not congruent to 0, i, or -i (mod 2k+1). Let B_(k,i)(n) denote the number of partitions of n wherein 1. 1 appears ...
The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...
The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...
...
View search results from all Wolfram sites (511308 matches)

