Example sentences of "if we [verb] [letter] " in BNC.
Next pageNo | Sentence |
---|---|
1 | And we plot along here if we plot Y against theta |
2 | If we let p i be the probability that an adjacent cell is vacant , then to a reasonable approximation this can be equated with the fraction of cells occupied by i polymer chains on the lattice i.e. which is valid for large values of z . |
3 | If we let X stand for any one of the sets X , Q , R , C , Z[x] , etc. mentioned in Chapter 1 , then the operations of addition and multiplication defined on X may be described as binary operations on X in that , to each pair of elements of X , both + and . |
4 | So if we let V not U Right , we let U be that , |
5 | So if we let Q equal sine X we can find D Q by D X we can differentiate this side with respect to X and that side Q by D X when we differentiate . |
6 | ‘ There 's no reason at the moment to suppose it 's not benign , but if we don t take it out , it could turn nasty . |
7 | If we write k for the ratio of capital to labour measured in efficiency units ( i.e. , capital per effective man ) , then the basic equation governing growth over time ( the analogue of ( 8–11 ) ) is |
8 | If we write g x for the proportional growth rate of variable x , and let we have ( using ( 8–4' ) ) and if we let denote output per capita , ( this needs to be modified where there is technical progress — see below ) . |
9 | If we write T for 3 or 4 , and S for 1 or 2 , then any infinite sequence of Ts and Ss has one and only one representation in Is , 2s , 3s and 4s which obeys the Fig. 6.6 rules . |
10 | If we write x i j for the number of items sent from i to j , the problem can be written as an LP . |
11 | If we write x i j = 1 if individual i is assigned to task j and x i j = 0 otherwise , the problem can be written : |
12 | Then , if we write x i for , the fifth constraint becomes . |
13 | If we write v for x , the equation of motion may be written as the first-order pair unc or , when{ x , v } is proportional to expt , unc This requires unc Giving of course the eigenvalues unc for each of which unc is simply degenerate . |
14 | If we make x 1 basic in P4/T1 , s 3 leaves the basis and we can ask if the tableau obtained by making this pivot will be efficient . |
15 | Knowing 1 , we now form the matrix 1I — A ; if we put r = 0,1 in ( 13 ) , multiply the first by 1 and then subtract the second : unc Premultiplication of this by |
16 | Since is non-basic there is currently no edge from I to J but we can always reach I from J in T because we can go from J to 1 and then from 1 to I. For example , if we take I = 3 and J = 7 in Fig. 8.1(a) , the unique paths from 7 to 1 and 3 to 1 are and and we can go from 7 to 9 to 1 to 9 to 2 to 3 . |
17 | That being so , B can not be trying to deceive A. The only way in which the assumption that B is cooperating can be maintained is if we take B to mean something rather different from what he has actually said . |
18 | For example : ‘ If we choose A , Harry , that will nearly double your advertising budget . ’ |
19 | If we choose K large enough to ensure that > 0 for all i , j , we can then use LPI to solve the problem . |
20 | Right okay so if we differentiate K T with respect to T we get K. |
21 | For example , we may assume the if we do P then Q will happen ; if Q happens then R will then occur . |
22 | What happens if we have N loops ( Fig. 4.2(a) ) round the varying flux ? |
23 | If we expand ( 1 ) we obtain successively unc If we eliminate q we find unc The same equation is satisfied by q . |
24 | But this implies that if we regressed C t on the three variables and entered separately , rather than as a sum as in equation ( 3.18 ) , we should observe that the coefficients estimated on these three variables are approximately all the same , as they are all estimates of α t , provided that we have specified the model correctly . |
25 | In particular , if we identify Q with the modal matrix X , then unc by ( 1.16.8 ) . |
26 | Nine five O minus would it help if we used X instead of N ? |