Help


[permalink] [id link]
+
Page "Dirichlet series" ¶ 5
from Wikipedia
Edit
Promote Demote Fragment Fix

Some Related Sentences

Suppose and additionally
Suppose that A is a set with a function w: A → N assigning a weight to each of the elements of A, and suppose additionally that the fibre over any natural number under that weight is a finite set.

Suppose and <
) Then X < sub > i </ sub > is the value ( or realization ) produced by a given run of the process at time i. Suppose that the process is further known to have defined values for mean μ < sub > i </ sub > and variance σ < sub > i </ sub >< sup > 2 </ sup > for all times i. Then the definition of the autocorrelation between times s and t is
Suppose that u and v satisfy the Cauchy – Riemann equations in an open subset of R < sup > 2 </ sup >, and consider the vector field
Suppose n < sub > 1 </ sub >, n < sub > 2 </ sub >, …, n < sub > k </ sub > are positive integers which are pairwise coprime.
Suppose random variable X can take value x < sub > 1 </ sub > with probability p < sub > 1 </ sub >, value x < sub > 2 </ sub > with probability p < sub > 2 </ sub >, and so on, up to value x < sub > k </ sub > with probability p < sub > k </ sub >.
Suppose that a speaker can have the concept of water we do only if the speaker lives in a world that contains H < sub > 2 </ sub > O.
Suppose that one particle is in the state n < sub > 1 </ sub >, and another is in the state n < sub > 2 </ sub >.
Suppose we have N particles with quantum numbers n < sub > 1 </ sub >, n < sub > 2 </ sub >, ..., n < sub > N </ sub >.
Suppose both ISPs have trans-Atlantic links connecting their two networks, but A < nowiki >' s </ nowiki > link has latency 100 ms and B's has latency 120 ms.
Suppose, for concreteness, that we have an algorithm for examining a program p and determining infallibly whether p is an implementation of the squaring function, which takes an integer d and returns d < sup > 2 </ sup >.
Suppose that whenever P ( β ) is true for all β < α, then P ( α ) is also true ( including the case that P ( 0 ) is true given the vacuously true statement that P ( α ) is true for all ).
Suppose M is a C < sup > k </ sup > manifold ( k ≥ 1 ) and x is a point in M. Pick a chart φ: U → R < sup > n </ sup > where U is an open subset of M containing x.
Suppose two curves γ < sub > 1 </ sub >: (- 1, 1 ) → M and γ < sub > 2 </ sub >: (- 1, 1 ) → M with γ < sub > 1 </ sub >( 0 )

Suppose and n
Take as an example a program that looks up a specific entry in a sorted list of size n. Suppose this program were implemented on Computer A, a state-of-the-art machine, using a linear search algorithm, and on Computer B, a much slower machine, using a binary search algorithm.
Suppose that in a mathematical language L, it is possible to enumerate all of the defined numbers in L. Let this enumeration be defined by the function G: W → R, where G ( n ) is the real number described by the nth description in the sequence.
Suppose A is a n by n Invertible matrix.
Suppose that Y is the sum of n identically distributed independent random variables all with the same distribution as X.
Suppose an array A with elements indexed 1 to n is to be searched for a value x.
Suppose then that n observations have been made
* Suppose that is a sequence of Lipschitz continuous mappings between two metric spaces, and that all have Lipschitz constant bounded by some K. If ƒ < sub > n </ sub > converges to a mapping ƒ uniformly, then ƒ is also Lipschitz, with Lipschitz constant bounded by the same K. In particular, this implies that the set of real-valued functions on a compact metric space with a particular bound for the Lipschitz constant is a closed and convex subset of the Banach space of continuous functions.
Suppose that L is a lattice of determinant d ( L ) in the n-dimensional real vector space R < sup > n </ sup > and S is a convex subset of R < sup > n </ sup > that is symmetric with respect to the origin, meaning that if x is in S then − x is also in S.
Suppose U is a simply connected open subset of the complex plane, and a < sub > 1 </ sub >,..., a < sub > n </ sub > are finitely many points of U and f is a function which is defined and holomorphic on U
Suppose n is Richardian.
Suppose there is a sample of n independent and identically distributed observations, coming from a distribution with an unknown probability density function f < sub > 0 </ sub >(·).
Suppose M is an m × n matrix whose entries come from the field K, which is either the field of real numbers or the field of complex numbers.
Suppose V is a subset of R < sup > n </ sup > ( in the case of n = 3, V represents a volume in 3D space ) which is compact and has a piecewise smooth boundary S. If F is a continuously differentiable vector field defined on a neighborhood of V, then we have

Suppose and is
Suppose Af is defined in the sub-interval Af.
Suppose they both had ventured into realms which their colleagues thought infidel: is this the way gentlemen settle frank differences of opinion??
Suppose, says Dr. Lyttleton, the proton has a slightly greater charge than the electron ( so slight it is presently immeasurable ).
Suppose it is something right on the planet, native to it.
Suppose there is a program
Suppose there is a chain at 1A, 2A, 3A, and 4A, along with another chain at 6A and 7A.
If two players tie for minority, they will share the minority shareholder bonus. Suppose Festival is the chain being acquired.
Alex is the majority shareholder, and Betty is the minority shareholder. Suppose now that Worldwide is the chain being acquired.
Suppose that R ( x, y ) is a relation in the xy plane.
Suppose that a car is driving up a tall mountain.
Suppose that the car is ascending at 2. 5 km / h.
Suppose the vector field describes the velocity field of a fluid flow ( such as a large tank of liquid or gas ) and a small ball is located within the fluid or gas ( the centre of the ball being fixed at a certain point ).
Suppose that F is a partial function that takes one argument, a finite binary string, and possibly returns a single binary string as output.
Suppose, says Searle, that this computer performs its task so convincingly that it comfortably passes the Turing test: it convinces a human Chinese speaker that the program is itself a live Chinese speaker.
; Dennett's reply from natural selection: Suppose that, by some mutation, a human being is born that does not have Searle's " causal properties " but nevertheless acts exactly like a human being.
Suppose that is a complex-valued function which is differentiable as a function.
Suppose a mass is attached to a spring which exerts an attractive force on the mass proportional to the extension / compression of the spring.

0.224 seconds.