Search Results for ""
2011 - 2020 of 2910 for Integer complexitySearch Results
The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...
The cotangent function cotz is the function defined by cotz = 1/(tanz) (1) = (i(e^(iz)+e^(-iz)))/(e^(iz)-e^(-iz)) (2) = (i(e^(2iz)+1))/(e^(2iz)-1), (3) where tanz is the ...
There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...
The Dedekind eta function is defined over the upper half-plane H={tau:I[tau]>0} by eta(tau) = q^_^(1/24)(q^_)_infty (1) = q^_^(1/24)product_(k=1)^(infty)(1-q^_^k) (2) = ...
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., ->, ^, ...
A special function which is given by the logarithmic derivative of the gamma function (or, depending on the definition, the logarithmic derivative of the factorial). Because ...
In general, an integer n is divisible by d iff the digit sum s_(d+1)(n) is divisible by d. Write a positive decimal integer a out digit by digit in the form ...
A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...
An Eisenstein series with half-period ratio tau and index r is defined by G_r(tau)=sum^'_(m=-infty)^inftysum^'_(n=-infty)^infty1/((m+ntau)^r), (1) where the sum sum^(') ...
An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...
...
View search results from all Wolfram sites (340627 matches)

