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 a number of scientists are assessing the probability of a certain outcome ( which we shall call ' success ') in experimental trials.

Suppose we start with one electron at a certain place and time ( this place and time being given the arbitrary label A ) and a photon at another place and time ( given the label B ).

Suppose we used the negative binomial distribution to model the number of days a certain machine works before it breaks down.

Suppose that a mathematician is studying geometry and shapes, and she wishes to prove certain theorems about them.

Suppose that there existed some process by which one could violate conservation of charge, at least temporarily, by creating a charge q at a certain point in space, 1, moving it to some other point 2, and then destroying it.

: Suppose that a judge or magistrate is faced with rioters demanding that a culprit be found for a certain crime and threatening otherwise to take their own bloody revenge on a particular section of the community.

Suppose that the crib is ATTACKATDAWN to be tested against a certain stretch of ciphertext, say, WSNPNLKLSTCS. The letters of the crib and the ciphertext were compared to establish pairings between the ciphertext and the crib plaintext.

Suppose that a random variable, X, is defined to be the time elapsed in a shop from 9 am on a certain day until the arrival of the first customer: thus X is the time a server waits for the first customer.

Suppose it is desired to estimate the failure rate of a certain component.

Suppose that certain outcomes are associated with three states of nature, so that ; This set of outcomes,, can be assumed to be a calculable money-prize in a controlled game of chance, unique up to one positive proportionality factor depending on the currency unit.

Suppose for simplicity that a certain system is characterized by two variables-a dependent variable x and an independent variable t, where x is a function of t. Both x and t represent quantities with units.

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 H ( M, w ) is the problem of determining whether a given Turing machine M halts ( by accepting or rejecting ) on input string w. This language is known to be undecidable.

Suppose E ( M ) is the problem of determining whether the language a given Turing machine M accepts is empty ( in other words, whether M accepts any strings at all ).

Suppose that the machine has several states, called FindIncrements, FindSubExprs and Completed.

Suppose, for example, that < tt > x </ tt >, < tt > y </ tt >, < tt > t1 </ tt >, and < tt > t2 </ tt > are all located on the same remote machine.

Suppose that a kilogram of seed costs one dollar, and this price does not change ; although there are other costs, assume they do not vary with the amount of output and are therefore fixed costs.

Suppose marginal costs were equal for the firms ( so the leader has no market advantage other than first move ) and in particular.

Suppose that you start with $ 10 in poker chips, and you repeatedly wager $ 1 on a ( fair ) coin toss indefinitely, or until you lose all of your poker chips.

Suppose bidding for an item placed by Anne starts at $ 1. 00 and that the bid increment amount in this price range is $. 25.

Suppose then that Bob bids $ 2. 00 for the item.

Suppose that Bob bids again, this time at $ 2. 75.

Suppose Bob bids one more time, at $ 10. 00.

Suppose a company issues warrants which give the holder the right to convert each warrant into one share at $ 500.

Suppose, a mutual fund that holds shares of the company sells warrants against those shares, also exercisable at $ 500 per share.

Suppose that B goes to a store and sees a sign that the price of a radio is $ 10.

Suppose that they both agree on the sale price in one year's time of $ 104, 000 ( more below on why the sale price should be this amount ).

Suppose the current stock price of IBM is $ 100.

Suppose an institutional investor places a limit order to sell 1, 000, 000 shares of stock XYZ at $ 10. 00 per share.

: Suppose you'd been earning $ 4, 000 to $ 5, 000 a week for years.

Suppose a game show participant may choose one of two doors, one that hides $ 1, 000 and one that hides $ 0.

Suppose a person earns $ 20, 000 per year and is liable to 20 % tax on earnings above a threshold of $ 5, 000 per year.

Suppose for instance that $ 100, 000 is borrowed with $ 1000 one-time fees paid in advance.

Suppose a United Kingdom manufacturing firm expects to be paid US $ 100, 000 for a piece of engineering equipment to be delivered in 90 days.

Suppose the store would sell the can of soup for $ 1. 20 as above, and would also sell a packet of pasta for $ 2. 80.

Suppose that in the absence of any tariffs, shoes use $ 100 worth of leather to make, and shoes sell for $ 150 in the international markets.

Suppose n < sub > 1 </ sub >, n < sub > 2 </ sub >, …, n < sub > k </ sub > are positive integers which are pairwise coprime.

Unicity: Suppose satisfies, then by Theorem 1. 8,.

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 >.

Player 1 moves first and chooses either F or U. Player 2 sees Player 1s move and then chooses A or R. Suppose that Player 1 chooses U and then Player 2 chooses A, then Player 1 gets 8 and Player 2 gets 2.

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 an array A with elements indexed 1 to n is to be searched for a value x.

Suppose that you add blue, then the blue – red – black tree defined like red – black trees but with the additional constraint that no two successive nodes in the hierarchy will be blue and all blue nodes will be children of a red node, then it becomes equivalent to a B-tree whose clusters will have at most 7 values in the following colors: blue, red, blue, black, blue, red, blue ( For each cluster, there will be at most 1 black node, 2 red nodes, and 4 blue nodes ).

Suppose a line runs through two points: P = ( 1, 2 ) and Q = ( 13, 8 ).

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 ( A < sub > 1 </ sub >, φ < sub > 1 </ sub >) is an initial morphism from X < sub > 1 </ sub > to U and ( A < sub > 2 </ sub >, φ < sub > 2 </ sub >) is an initial morphism from X < sub > 2 </ sub > to U. By the initial property, given any morphism h: X < sub > 1 </ sub > → X < sub > 2 </ sub > there exists a unique morphism g: A < sub > 1 </ sub > → A < sub > 2 </ sub > such that the following diagram commutes: