Search

17 Jun 2005: J. Baues, S. Halperin and J.-M. Lemaire. DMV Seminar, 24, Birkhuser Verlag, Basel,1995.

21 May 2005: A.G.Thomason@dpmms.cam.ac.uk - 1 - 24 January 2005. 13) Prove that a graph G is k-connected iff |G| k 1 and for any U V (G) ... A.G.Thomason@dpmms.cam.ac.uk - 2 - 24 January 2005.

21 May 2005: ANALYSIS II EXAMPLES 1. Michaelmas 2004 J. M. E. Hyland. This sheet contains Basic Questions, which focus on the examinable component of the course, to-gether with Additional Questions for those wishing to take things further. The questions are not

18 Oct 2005: ANALYSIS II EXAMPLES 1. Michaelmas 2005 J. M. E. Hyland. The Basic Questions are cover examinable material from the course. The Additional Questions arefor those wishing to take things a bit further. The questions are not all equally difficult; I

21 May 2005: 3. (i) Show that X4 2X 2 and X4 18X2 24 are irreducible in Q[X].(ii) Are X3 9 and X4 8 irreducible in Q[X]?(iii) Show that X4

21 May 2005: 4n 3} then G contains a cycle of length 4. 24) Let G be a graph of order n and let G1,.

27 Oct 2005: 24) (i) Show that H(X|Y ) 0 with equality if and only if X is a function of Y.

21 May 2005: 24) Show that the repetition code of length n is perfect if and only if n is odd.

14 Mar 2005: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs. W. T. Gowers. Abstract. The main results of this paper are regularity and counting lemmas for 3-. uniform hypergraphs. A combination of these two results gives a new proof of a

24 Nov 2005: T.A.Fisher@dpmms.cam.ac.uk - 1 - 24 November 2005. 54) Alice and Bob are issued with RSA public keys (N, e1) and (N, e2), and correspondingprivate keys (N, d1) ... Show that the sequence in (ii) has period 2d 1. T.A.Fisher@dpmms.cam.ac.uk - 2 - 24