Consider a social network in which nodes are people and links are acquaintance relationships between people.

Consider a social decision model of the kind used in the theory of social choice ( such as used in stating Arrow's theorem ).

Consider also this quotation from Karl Marx: " A house may be large or small ; as long as the neighboring houses are likewise small, it satisfies all social requirement for a residence.

* Consider issues relating to regional and international cooperation in strategic planning and implementation of social development and health policies and programs.

* Consider issues relating to regional and international cooperation in strategic planning and implementation of social development and health policies and programs.

Consider a web browser which attempts to load a page while the network is unavailable.

Consider the graphic to the right, which represents the computer network.

Consider a road network as shown in the adjacent diagram, on which 4000 drivers wish to travel from point Start to End.

Consider a network as a graph where each edge ( i. e. link ) has an associated cost of transmission, privately known to the owner of the link.

Consider non-powered taps for optical-only environments or throwing star network tap for copper 100BT.

Consider the unitary form defined above for the DFT of length N, where

* Consider now L = Q ( ³ √ 2, ω ), where ω is a primitive third root of unity.

Consider now the acceleration due to the sphere of mass M experienced by a particle in the vicinity of the body of mass m. With R as the distance from the center of M to the center of m, let ∆ r be the ( relatively small ) distance of the particle from the center of the body of mass m. For simplicity, distances are first considered only in the direction pointing towards or away from the sphere of mass M. If the body of mass m is itself a sphere of radius ∆ r, then the new particle considered may be located on its surface, at a distance ( R ± ∆ r ) from the centre of the sphere of mass M, and ∆ r may be taken as positive where the particle's distance from M is greater than R. Leaving aside whatever gravitational acceleration may be experienced by the particle towards m on account of ms own mass, we have the acceleration on the particle due to gravitational force towards M as:

Consider Peter Unger's example of a cloud ( from his famous 1980 paper, " The Problem of the Many "): it's not clear where the boundary of a cloud lies ; for any given bit of water vapor, one can ask whether it's part of the cloud or not, and for many such bits, one won't know how to answer.

Consider, also, that all English speakers often pronounce ' Z ' where ' S ' is spelled, almost always when a noun ending in a voiced consonant or a liquid is pluralized, for example " seasons ", " beams ", " examples ", etc.

Consider the case where the far end of the cable is shorted ( that is, it is terminated into zero ohms impedance ).

Consider the plane spanned by and, where is a ket in the subspace perpendicular to.

Consider a quantum ensemble of size N with occupancy numbers n < sub > 1 </ sub >, n < sub > 2 </ sub >,..., n < sub > k </ sub > corresponding to the orthonormal states, respectively, where n < sub > 1 </ sub >+...+ n < sub > k </ sub >

We say that the number x is a periodic point of period m if f < sup > m </ sup >( x ) = x ( where f < sup > m </ sup > denotes the composition of m copies of f ) and having least period m if furthermore f < sup > k </ sup >( x ) ≠ x for all 0 < k < m. We are interested in the possible periods of periodic points of f. Consider the following ordering of the positive integers:

Consider a database that records customer orders, where an order is for one or more of the items that the enterprise sells.

Consider the simple experiment where a fair coin is tossed four times.

Consider a number n > 0 in base b ≥ 2, where it is written in standard notation with k + 1 digits a < sub > i </ sub > as:

: Example: Consider a scenario where a legitimate party called Alice encrypts messages using the cipher-block chaining mode.

Consider for example, the sharing of food in some hunter-gatherer societies, where food-sharing is a safeguard against the failure of any individual's daily foraging.

Consider the simple case of two-body system, where object A is moving towards another object B which is initially at rest ( in any particular frame of reference ).

Consider a 10 year mortgage where the principal amount P is $ 200, 000 and the annual interest rate is 6 %.

Consider a simple banking application where two users have access to the funds in a particular account.

Consider the polynomial ring R, and the irreducible polynomial The quotient space is given by the congruence As a result, the elements ( or equivalence classes ) of are of the form where a and b belong to R. To see this, note that since it follows that,,, etc.

Consider a random walk on the number line where, at each step, the position ( call it x ) may change by + 1 ( to the right ) or-1 ( to the left ) with probabilities:

Consider a system where the gun and shooter have a combined mass M and the bullet has a mass m. When the gun is fired, the two systems move away from one another with new velocities V and v respectively.

Consider a circuit where R, L and C are all in parallel.

Consider an MDCT with 2N inputs and N outputs, where we divide the inputs into four blocks ( a, b, c, d ) each of size N / 2.

Consider for example the same task as above but with an array consisting of 1000 numbers instead of 100, and where all numbers have the value 1.

Consider the physical model of the citizenship of human beings in the early 21st century, where about 30 % are Indian and Chinese citizens, about 5 % are American citizens, about 1 % are French citizens, and so on.

Consider the graph of the equation y = 1 / x shown to the right.

Consider a function with its corresponding graph as a subset of the Cartesian product.

Consider a complete graph on R ( r − 1, s ) + R ( r, s − 1 ) vertices.

Proof of claim: Consider a graph on t vertices and colour its edges with c colours.

Consider a graph G with vertices V, each numbered 1 through N. Further consider a function shortestPath ( i, j, k ) that returns the shortest possible path from i to j using vertices only from the set

Consider a graph known to have all edges in the same component and at most two vertices of odd degree.

Consider the Ferrers graph of any partition of n into distinct parts.

Consider the formation, one generation at a time, of the ancestor graph of all living humans with no descendants.

Consider a grid graph with r rows and c columns ; the total number n of vertices is r * c. For instance, in the illustration, r = 5, c = 8, and n = 40.

Consider a graph, with a perfect matching.

Consider the expansion of to, a maximally imperfect graph, in the sense that is a spanning subgraph of but adding an edge to will result in a perfect matching.