Suppose, says Dr. Lyttleton, the proton has a slightly greater charge than the electron ( so slight it is presently immeasurable ).

Suppose a particle has position in a stationary frame of reference.

Suppose a definition of a capacitor has an associated attribute called " Capacitance ", corresponding to the physical property of the same name, with a default value of " 100 pF " ( 100 picofarads ).

Suppose Alice has a qubit in some arbitrary quantum state.

Suppose Alice has a qubit that she wants to teleport to Bob.

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 that a certain slot machine costs $ 1 per spin and has a return to player ( RTP ) of 95 %.

Suppose the typewriter has 50 keys, and the word to be typed is banana.

Suppose this fuzzy system has the following rule base:

Suppose a lossless antenna has a radiation pattern given by:

Suppose a partially ordered set P has the property that every chain ( i. e. totally ordered subset ) has an upper bound in P. Then the set P contains at least one maximal element.

Suppose a non-empty partially ordered set P has the property that every non-empty chain has an upper bound in P. Then the set P contains at least one maximal element.

:" Moses said to God, ' Suppose I go to the Israelites and say to them, " The God of your fathers has sent me to you ," and they ask me, ‘ What is his name ?’ Then what shall I tell them ?” God said to Moses, “ I AM WHO I AM " — Exodus 3: 13-14 ( New International Version ) ( see Tetragrammaton ).

Suppose a computer has three CD drives and three processes.

Suppose, for example, that A is a 3 × 3 rotation matrix which has been computed as the composition of numerous twists and turns.

Suppose that a taxi firm has three taxis ( the agents ) available, and three customers ( the tasks ) wishing to be picked up as soon as possible.

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

INTERVIEWER: Suppose someone called you and said there was a kid, nineteen or twenty years old, who has been a very good boy, but all of a sudden this week he started walking around the neighborhood carrying a large cross.

Suppose Eve has intercepted the cryptogram below, and it is known to be encrypted using a simple substitution cipher:

Suppose that one has a table listing the population of some country in 1970, 1980, 1990 and 2000, and that one wanted to estimate the population in 1994.

Suppose the table has r rows and c columns ; the row sums are and the column sums are.

* Suppose that is the infinite cyclic group and the set S consists of the standard generator 1 and its inverse (− 1 in the additive notation ) then the Cayley graph is an infinite chain.

Suppose that the products are sold in separate markets ( this is commonly the case ) so demands are independent, and demand for good n is with inverse demand function Total revenue is

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 that is a complex-valued function which is differentiable as a function.

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 the formula for some given function is known, but too complex to evaluate efficiently.

Suppose that I is an interval b in the real numbers R and that f: I → R is a continuous function.

# Suppose there exists a function called Insert designed to insert a value into a sorted sequence at the beginning of an array.

Suppose that the set of indices such that is decidable ; then, there exists a function that returns if, and otherwise.

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 ƒ is a continuous complex-valued function defined on the real interval.

: Suppose X is a compact Hausdorff space and A is a subalgebra of C ( X, R ) which contains a non-zero constant function.

Suppose that x and y are real numbers and that y is a function of x, that is, for every value of x, there is a corresponding value of y.

Suppose that ƒ is a function of more than one variable.

Suppose U is an open subset of the complex plane C, f: U → C is a holomorphic function and the closed disk

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 f is an analytic function defined on an open subset U of the complex plane.

Suppose z is defined as a function of w by an equation of the form

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 you have a function

Suppose that g and h are total computable functions that are used in a recursive definition for a function f:

Suppose that is a continuous function.

Suppose is a function from Euclidean n-space to Euclidean m-space.

Suppose that the alternatives can be partitioned into subsets, where each subset has its own cost function, and each alternative belongs to only one subset.

Suppose that f ( p, q, t ) is a function on the manifold.