TOPICS
Search

Search Results for ""


5751 - 5760 of 13135 for Discrete Fourier TransformSearch Results
A natural transformation Phi={Phi_C:F(C)->D(C)} between functors F,G:C->D of categories C and D is said to be a natural isomorphism if each of the components is an ...
The British word for "zero." It is often used to indicate 0 subscripts, so a_0 would be spoken as "a naught."
The general equation of fluid flow (lambda+2mu)del (del ·u)-mudel x(del xu)=rho(partial^2u)/(partialt^2), where mu and lambda are coefficients of viscosity, u is the velocity ...
A problem in the calculus of variations. Let a vessel traveling at constant speed c navigate on a body of water having surface velocity u = u(x,y) (1) v = v(x,y). (2) The ...
An arrangement of n>=3 points such that n-1 of them are collinear.
Every irrational number x can be expanded in a unique continued fraction expansion x=b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...)))=[b_0;e_1b_1,e_2b_2,e_3b_3,...] such that b_0 ...
A condition which must hold for a result to be true, but which does not guarantee it to be true. If a condition is both necessary and sufficient, then the result is said to ...
The operation of interchanging true and false in a logical statement. The negation of A is often called "NOT-A," and can be denoted !A, or with the negation sign ¬, so not-A ...
The symbol ¬ used to denote the negation operation ("NOT") in symbolic logic, also called "logical not."
The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...
1 ... 573|574|575|576|577|578|579 ... 1314 Previous Next

...