Example sentences of "we can write " in BNC.
Next page| No | Sentence |
|---|---|
| 1 | If we can write back to somebody , or send them the CD or shirt they want , we will almost certainly have them for life . |
| 2 | Since the firm in our example is operating under conditions of perfect competition , in which price equals marginal revenue , we can write unc where P is the price of the product . |
| 3 | Price is then defined simply as : unc If we denote the profit margin as K , we can write this expression as : unc This pricing method is used in most cases where prices are determined by sellers rather than buyers ; that is , in nearly all manufacturing industry where the seller sets the price and the buyer accepts it . |
| 4 | Using functional notation , we can write : unc which states that the total number of jobs on offer is a function of , or depends on , the rate of national income and real labour costs . |
| 5 | Laspeyres price index in 1985 = unc For 1986 , the index would be calculated in a similar way : Laspeyres price index in 1986 = unc Denoting the current year 's prices by P 1 and the base year 's prices and quantities by P 0 and Q 0 respectively , we can write the general formula as : Laspeyres price index = |
| 6 | Now denoting the nominal demand for money by MD , we can write in functional form : unc A simplified version of this function can be obtained by using real national income ( Y ) as an indicator of total wealth and by assuming that h is constant and that the function is homogeneous of the first degree in P. We can then write the real demand for money as : unc Monetarists generally believe the demand for money to be fairly unresponsive to interest rate changes ( and this is supported by empirical evidence ) . |
| 7 | Thus , we can write : unc where k is a constant . |
| 8 | Thus , for every item included in calculating the price index used to measure the inflation rate , we can write : Price = |
| 9 | Thus , we can write : Price = unc ( 2 ) Now consider average labour cost : this is defined as total labour cost divided by output . |
| 10 | Thus , we have : Average labour cost = Dividing the numerator and denominator by the number of people employed , we can write : Average labour cost = But the numerator now represents ‘ average wage earnings ’ and the denominator the ‘ average productivity of labour ’ . |
| 11 | Once all the for the rth generation have been determined , we can write them down for the ( r+1 ) th generation using ( 8.3 ) . |
| 12 | In the same way , if , we can write and develop the down-problem , declaring the node on the up-branch inactive . |
| 13 | Similarly , for , we can write , where and define since f(2) = 2 . |
| 14 | quite a few we can write at the bottom er for more inf if you have any more information or something in small print |
| 15 | Erm , so what were doing is were , we hope were waiting for a new prisoner to be allocated to us , erm , and perhaps we could , perhaps we could , perhaps we can write and remind you think , think we should do that ? |
| 16 | So instead of ‘ the telephone must be manned at all times ’ we can write ‘ the telephone must be staffed at all times ’ |
| 17 | In fact we only need to prove unc which we can write in abbreviated form as unc ( Compare this with the deduction of a = b = c given that unc and |
| 18 | We can prove the important Theorem 1.9.14 ( Gauss ) If F ε Z[x] and if we can write F = gh where g , h ε Q[x] then we can write F = GH where G , H ε Z[x] , deg G = deg g and deg H = deg h . |
| 19 | We can prove the important Theorem 1.9.14 ( Gauss ) If F ε Z[x] and if we can write F = gh where g , h ε Q[x] then we can write F = GH where G , H ε Z[x] , deg G = deg g and deg H = deg h . |
| 20 | That is to say , we can write it in the form unc where x and y are real ( that is to say , " ordinary " numbers ) . |
| 21 | We can write these as unc where the column matrices are all functions of time . |
| 22 | Suppose instead that we can write A as unc where B , C are symmetric ; then we have unc or BX = CX . |
| 23 | Suppose we wish to remove the unit from the superdiagonal in the matrix unc by means of a similar transformation ; we can write the most general transformation matrix as unc Then unc and if both off-diagonal elements are to vanish , then unc Provided unc we may satisfy ( 4 ) and |
| 24 | If we cancel one factor from both sides , we can write unc and then , as before , we can prove that |
| 25 | Now we collect all terms involving unc and write them as a perfect square , and so on , so that ultimately we can write the form as unc where in fact unc and unc while y is related to x by the triangular substitution ( see ( 20 ) ) unc and |
| 26 | Let unc where C is the canonical spectral matrix unc of A , and X is the modal matrix of A:X is not unique ; if we have any matrix Y which permutes with C , then from ( 24 ) AXY = XCY = XYC so that we can write the modal matrix of A alternatively as XY . |
| 27 | Now it is possible to write down a sequence of matrices unc Mr ( r is usually n or n + 1 , depending on the variant employed ) which when used as a chain to premultiply A , condense it to the unit matrix , so that unc which evidently implies unc The numerical procedure is to operate successively on 91 ) ; given A we can write down M1 and we evaluate unc so that ( 1 ) becomes unc Knowing B we can now write down unc and form unc and so on , until R is obtained . |
| 28 | Indeed , if , for example in ( 5 ) , unc and higher powers are sensibly null to the order of accuracy required , we can write unc saving one multiplication . |
| 29 | We can write the reciprocal of A as unc and then the product of ( 2 ) and ( 3 ) yields ( twice ) unc These may be solved if either P or Q is non-singular ; we assume P-1 exists , and we write R for P-1Q . |
| 30 | Then as in 2.4.2 we can write A as unc where B is triangular . |