He swung round to the other men -- `` We can catch him easy!!

We can soon tell ''.

`` We can get it if we dig '', he said patiently.

`` We can boil it '', he said.

We have staved off a war and, since our behavior has involved all these elements, we can only keep adding to our ritual without daring to abandon any part of it, since we have not the slightest notion which parts are effective.

We assume for this illustration that the size of the land plots is so great that the distance between dwellings is greater than the voice can carry and that most of the communication is between nearest neighbors only, as shown in Figure 2.

We hear equally fervent concern over the belief that we have not enough generalists who can see the over-all picture and combine our national skills and knowledge for useful purposes.

We can also argue that the three brothers Karamazov and Smerdyakov were the external representatives of an internal conflict within one man, Dostoevsky, a conflict having to do with father-murder and the wish to possess the father's woman.

We feel uncomfortable at being bossed by a corporation or a union or a television set, but until we have some knowledge about these phenomena and what they are doing to us, we can hardly learn to control them.

We must avoid the notion, suggested to some people by examples such as those just mentioned, that ideas are `` units '' in some way comparable to coins or counters that can be passed intact from one group of people to another or even, for that matter, from one individual to another.

We can conceive of no alternatives.

We can be virtuous only if we control our lower natures, the passions in this case, and strengthen our rational side ; ;

We must, first of all, be willing to forgive others before we can secure God's forgiveness.

We don't think she can make her child defective, emotionally disturbed or autistic.

We can attack Tshombe, but not Gigenza.

We can force Britain and France out of the Suez, but we cannot so much as try to force the Russian tanks back from Budapest.

We can mass our fleet against the Trujillos, but not against the Castros.

We can vote in the UN against South African apartheid or Portuguese rule in Angola, but we cannot even introduce a motion on the Berlin Wall -- much less, give the simple order to push the Wall down.

We can expect more of the same.

We can help in the planning process

We can no longer rely on interdepartmental machinery `` somewhere upstairs '' to resolve differences between this and other departments.

We must determine whether missiles can win a war all by themselves.

We have developed an ingenious method of interlocking these so that you can make the major part of your house in your own workshop, panel by panel, according to plan.

We gently usher them to an island of tables and chairs strategically placed on the far side of the pool where they can amuse each other until we get ready to merge sides.

We found that three men -- two carpenters and a helper -- can put up wall panels or trusses more economically than four men -- because four men don't make two teams ; ;

* The indie rock band Liars ' album They Were Wrong, So We Drowned is a concept album loosely based on tales of the gatherings of witches on The Brocken as well as witch trials.

Notable examples are his 1966 short story " We Can Remember It for You Wholesale ", on which the movie Total Recall is loosely based, and his 1977 novel A Scanner Darkly which was also turned into a film.

The appearance of Sir Winston Churchill Secondary had been loosely adapted for Chamberlain Secondary School in the webcomic We Can Sleep Tomorrow, the exterior of the school being prominently featured in a comic dated October 9, 2009.

We can interpret the papyrus as suggesting the sources of knowledge kept by scribes in the " House of Life ".

We can interpret as representing an ensemble where is the proportion of the ensemble whose states are.

We then interpret the phrase " lend me your ear " metaphorically to mean that the speaker wants the listener to grant the speaker temporary control over what the listener hears.

We can interpret the first case as a rotation by θ ( where θ = 0 is the identity ), and the second as a reflection across a line at an angle of θ / 2.

We can interpret the basis vectors as lying in W if we write

We can further interpret this equality by considering the abstract change of variables formula to transport the integral on the right hand side to an integral over Ω:

These warned travellers: ' We will not cover claims arising from equipment or any computer program failing to recognise, interpret or process any date changes for example the year 2000.

He summarized it: We make maximum sense of the words and thoughts of others when we interpret in a way that optimises agreement.

We thus obtain the inequality in terms of dimensions of kernel, which can then be converted to the inequality in terms of ranks by the rank-nullity theorem.

i. e., z is a vector orthogonal to the vector v ( Indeed, z is the projection of u onto the plane orthogonal to v .) We can thus apply the Pythagorean theorem to

We consider a special case of this theorem for a binary symmetric channel with an error probability p.

There is a special case of Lagrange inversion theorem that is used in combinatorics and applies when and Take to obtain We have

We may use the theorem to compute the Taylor series of at

Abstractly, we can say that D is a linear transformation from some vector space V to another one, W. We know that D ( c ) = 0 for any constant function c. We can by general theory ( mean value theorem ) identify the subspace C of V, consisting of all constant functions as the whole kernel of D. Then by linear algebra we can establish that D < sup >− 1 </ sup > is a well-defined linear transformation that is bijective on Im D and takes values in V / C.

We can calculate the length of the line from its center to the middle of any edge as using Pythagoras ' theorem.

We now use the Pythagorean theorem, the fact that the slope of the curve is equal to the tangent of its angle, and some trigonometric identities to obtain ds in terms of dx:

We shall therefore now consider only arguments that prove the theorem directly for any matrix using algebraic manipulations only ; these also have the benefit of working for matrices with entries in any commutative ring.

We also know from Shannon's channel coding theorem that if the source entropy is H bits / symbol, and the channel capacity is C ( where C < H ), then H − C bits / symbol will be lost when transmitting this information over the given channel.

We apply the theorem in the space R < sup > n </ sup >.

We represent the surface by the implicit function theorem as the graph of a function, f, of two variables, in such a way that the point p is a critical point, i. e., the gradient of f vanishes ( this can always be attained by a suitable rigid motion ).

We prove the complex version of the hairy ball theorem: V has no section which is everywhere nonzero.

We state the theorem first for the special case when the underlying stochastic process is a Wiener process.

We now have enough information to apply Van Kampen's theorem.

We obtain an equivalence relation on CSAs over K by the Artin – Wedderburn theorem ( Wedderburn's part, in fact ), to express any CSA as a M ( n, D ) for some division algebra D. If we look just at D, that is, if we impose an equivalence relation identifying M ( m, D ) with M ( n, D ) for all integers m and n at least 1, we get the Brauer equivalence and the Brauer classes.

We derive the fluctuation-dissipation theorem in the form given above, using the same notation.

We will first state a simplified version of Tarski's theorem, then state and prove in the next section the theorem Tarski actually proved in 1936.

We can expand ƒ ( x ) around x < sub > 0 </ sub > by Taylor's theorem,

We claim that without loss of generality, the latter inequality is always strict ; once we do this the theorem can be proved as follows.

We will proceed to apply Banach fixed point theorem using the metric on induced by the uniform norm

We use to mean is a theorem.

We will see that for compact operators, the proof of the main theorem uses essentially the same idea from the finite dimensional argument.