Sie sind auf Seite 1von 13
L @ Let f(p)= p? +p -Sp—2, then f(2)= 2 +2?-10-2=0 Therefore p =2isa solution of f(p)=0. Now f(p)=(p-2\(p? +3p+1) = (Students may use other approaches, use your discretion) ‘The rest of the solutions can be found by using the quadratic formula onp?+3p+1=0 Heence these solutions are p= —-S*> (@)G@ Arithmetic sequence: 1, 1+ p, 1+2p, 1+3p Geometric sequence: 1, p, p*, (i) (1+2p)+(1+3p)= p? +p? = p+ p?-Sp-2=0 +5 Therefore, from part (), p=2, p= 2 (iii) (@) The sum to infinity of a geometric series exists iff |p|<1, +5 2 Hence, p is the only such number. (b) The sum to infinity of the geometric series is a 1 “3 fs 2 wai cmvepso <2 p= (©) The sam of the first 20 terms of the arithmetic series can be found by applying the sum formula =10(97 2194) = 10(7.419p) fol So, Sxo 1No71s1074(2) each (cL) (M1) (AL (AD (ap (C2) (cy) (cy (al) (C2) (ay (cl) (AD) NOTIS1OnH(2) 3. @ (@) The vectors J, 1 are parallel to Z, and L; respectively. (cy Also, if we let #=-27 +117 +7, then 7, = -6-22+28=0 andi-i, = 44 11-7=0 «cy ‘Therefore the required vector is perpendicular to both lines. (cy (b) L, and Z; have the following parametric equations: Tx=3t42, yat-2, rade and [yx =2u-2 youth 2=2-u (cy For an intersection to happen. the following system must be consistent e (Ry) (cD from (2) and (3) we have ¢ = 1. Hence w= ~2, However these values AD do not satisfy (1) since 5-6. Therefore the lines cannot meet. RY) (©) Since 2i +117 +7k, is perpendicular to both L, and Z;, and since the plane contains one of the lines and is parallel to the other, therefore Z isnormal tn the plane The equation af this plane is of the form @ 2+ lly+ zed, ‘The point (2, 1, 0) lies on L, and on P, therefore a @ ~4+11+0=d, hence d = 7and the equation is (ay Det Lly +7287. (i) (@) The required system is kat Vs ° 1 1 k-2fy|=| ke2 Bee alee (C2) (-1 for each error) () det(M) = 0 => 2(k-2)-k~(k+1)(k-2(k-2))-0=0 i -2k-0-0 on ork=-2 (ay (AL Bren ane: (©) (@ Using Gaussian elimination on the following matrix will lead us to the solution: cl kel -1 0 11 k-2 b+ 2 2 kB a2k=8 with 2 elementary row operations, the system will be sl kel = 0 0 +2 k-3 k42 0 0 -k+4 KP =4k-12, ‘Therefore the vale of 7 can be read from the Inst sow He ~4k-12 ak (ii) When k= 4, the value of z is undefined, and hence the system has no solution. ‘When k=~2, the system is a homogenous system, and hence it ‘admits at leeat one solution. It is reduced to x+y 0 z=0 ‘Hones it has an infinite number of solutions. For all other values of &, the system has @ unique solution. NoT/stoni@2) (Cl) (cy (AD @y (Ry wap (Al) 4 @ y=2xsinx+cos2x y = 2sin2x + 4xcos2x ~2sin 2x = 4x0s: -s 2x ~ 2sin 2x =4xcos2x ) Required volume V = x{""(JFcosa) de =x [""(xcos*x) dr 5 SE i +cos2s) dr = 3 "(2+ xc082) dr See ecte ae eeaceerta (ee e yield ml it 1 "2 3(heefeenaeen _a(w 1 1) nee TE Ae 9 Gi) @_ g(x)=x41-e* = g(x) = 1-07 = 0 when x -0, also, g'(x)<0 when x >0 and g’(x)>0 when x <0; + 8(@) will increase for x <0 and decrease for x0, hence the function has a maximum value at x =0, g(0)=0. 1 g(@)S0VxER, > x4l-e' $0, x41Se" (®)G) From the previous result, we have € -12 2, and since its given that => 0, aun we know duet &* 2 O dividing both sides of cis inequality by xe will yield e-1 1 > ap thatisf(x)>0™, eer gr tals): @ s@)= (ii). also from (i)(@) and since g(x) <0 for allx €R, and since replacing x by —x will result in reflecting the fiction sbout the y-axis, therefore its maximum will not change, and hence e(-x)S0, g(-2)=-x4+1-e7 $0 =>1-e7 sx and dividing both sides of this inequality by the positive expression xe* will yield f(x)k*,-leo 7,1, -i «> kis sucha 1-1 correspondence. Hence Hand K are isomorphic. Since the two groups are isomorphic, and X is Abelian, then H has tobe Abelian. A cyclic group is a group G with atleast one element a, such that every element 4 ¢Gcan be expressed as b=a' for some i< mn, and a” =e where m is the order of the group. Clearly 2° =1, and a generates the group elements. Also atl =o = 1, hence the order ign + 1 For the group to be Abelian, ab= ba for all a and d in G. Now, (a0)’ =(ab)(ab), and (a0)’ =40, therefore, ubub = wudl, ‘multiplying on the left by a” and on the right by 5~ will yield ab = ba, Hence, the group is Abelian. u NovIstoni(2) (C2) (ca (1 for each ay (cy jm (cy (Rl) eo (2) (R2) (cy (Rl) er ‘Nov/stoni2) 6. (@ @ Any layout is acceptable. A D (cy of Gl for each error) B Cc (b) An isomorphism is a 1-1 correspondence so that images of any two adjacent vertices are also adjacent end conversely. By looking at the oo @ adjacency matrix of G, we observe that F has an out degree of | and (cy so does Xin H, we also observe that B has an out degree of 4 and so does Z. Therefore these shouldbe images ofeach other inthe required @) ‘somorphism. We also see that C has an out degree of 3 and so does U in H. D has a 2 out and 3 in degrees, so does W. By similar reasoning, we have A and V correspond as well as E and Y. Hence the required isvuwaphisus is: (3) AOV,BOZ,COU, DOW, EY, and Fo X. * (©) Fora simple connected graph G, with at least three edges, 10 be planar, @ then according to Euler's formula ¢ < 3-6 but 14>18-6, therefore G cannot be planar. @y(ch) ech Gi) (@ Prim’s algorithm requires that we startat any vertex at random and consider it as a tree, then look for the shortest path that joins a vertex on this tree to any of the remaining vertices and add it, then repeat the ° last step until all the vertices are on the tree. 7 ‘(R2) Starting at F, (other forms can be used) : 1. The shortest path from F to ABCDEGH isto E, add FE => weight i added = 90 2. The shortest path from FE to ABCDGH is to G, add FG with i weight 120, : 3, The shortest path from GFE to ABCDH is to H. add GH with weight 220, 4. The shortest path from GFEH to ABCD is to C, add FC with weight 230, 5. (ABD) Add CB with weight 240, 6. (AD) Add BA with weight 180, 7, (D) Add AD with weight 200. a (1 for each Therefore a minimal tree has a weight of 1280, a | 2 pslekele 1N9T/S 1072) A (b) To find the minimum path from A to H using Dijkstra’s algorithm we (ay assign a weight of zero to the first vertex and a weight of «oto all ‘vertices that are not inthe path, Then we start adding vertices adjacent to the present ones that have a minimum weight. At each iteration, the Tength of the path toa given vertex is evaluated and the minimum is aseigned ™ (2) 40) AB ~180, = B(180) AD =200, = D (200) AC=270, => C(270) ADF = 480 is the minimum path to F, => F (480) ADE = 480 is the minimum path to E,=> E (480) (RS) (-1 for ACG = 620 is the minimum path to G, => G (620) = error) ADI ~ 600 ia the minimum to G, =» New G (600) © [ADEH = 840 is the minimum to H, => H (840) ADPGH = 820 1s the minimum to H, => NEW Hf (820). This is a minimum path from A to H. (ay Gii)(@) ON | e c D (©) There is no such walk since the graph has 4 vertices with odd degree. Fi 21) there is no Euler’s ¢ “ Therefor Euler’s cycle nor a path. o Ifthe door between 4 and B is locked then there will be a Euler path through the whole graph. There will be only two vertices, C and F with (R}) an odd degree. 13 ‘Therefore our walk should start at one end at the other. Such a walk could be the following: FBFEFDBEDCAFACFC. (© Stu we degre of ach vee sper tian 2 5, ere Hamiltonian circuit, Such a circuit could be FABEDCF. NaT/S10n#@2) ay (A2) (RI) (ayy (2) The confidence interval gives a range of values which has a 95% probability of containing the mean of the population. ‘That is the interval (x-wZ., R- 156-4) if calculated repeatedly, then 959% of such intervals will contain the pepulation mean. 1.96 is the ‘number of standard deviations away from the mean and is read from the standard normal table. According to the scheme above, the confidence intervals are: Male: vrs 96 (55) =(172824,175176) Female: 17341 a(t = (170844, 175154) Not enough evidence of any difference between the performance of males and females since each of the confidence intervals contain the mean of the ‘opposite sample. (&) Finding the confidence interval forthe difference between the means is similar to the process above, however the standard error is different. The ‘confidence interval is 5, -%, 2196 [S04 SE (Hy ~ He) = Ey Fp £196 | Ma he Tae =174-1732196) = 4h 400 “100 ‘The result here confirms our previous findings, since this interval contains zero. Which indicates that the situation where the two means are equal is, flay @ uscuiber uf Use voufideuee ites val. (-1456,3456) (2) 1. Form the null hypothesis: Hoy — He = 0 ‘The alternate hypothesis: Hy:Hy ~ Hp >0 2. The test statistic is 2, Fu ~Fp— (Hr) _1T4=173-0 gag a su 4 SE Tye My 3. Critical value for Z, for a one-tail testis 1.645. Since Z, =0.198 <0,r(n)> 2, and so the series diverges. ech i. 2 (4) (@) Using me wapeztum rule the area under the cui ve is approximated Ly 1, = SA [slee)+ flee) +2{ Fa) F Gall] = 1 0100+0199+0.296 +0297 +0479 an : = pylooseer| 0565 + 0644 + 0717+ 0.783 i 7, -0.450 AD oo () The volume in question is V = [,[f(2)] dx , hence the function values in the table have to be squared. (R2) Yo FAY ty Ag + Ya) HR (C2) © 0? +4x 0100" +2x 01997 +4x 0.296 + V mE) 20.297? +4x0479 +2 0565" + 4x 0.644? +2 0.717? +4 0.783" +0841? (2) vy = UZb%R = U.s4S cubte unis. ay 17 Oo (ii)(@) The Maclaurin series for a function f(x) is 2 fs : F(z)= f(O)+ af (0+ Lr where 0 <|e <|x. Thus, 5 sing =0+x+0xx7 +0xx* +7 cose, 0<{q<[x. 3 3215. Obviously x = -3-V/T5 cannot approximate x? = sinx, ‘thus x, =-3+~15 is the only approximate solution. Now where 0<¢

Das könnte Ihnen auch gefallen