Search

15 Jun 2000: How to discover a proof of the fundamental theorem of arithmetic. The usual proof. Here is a brief sketch of the proof of the fundamental theorem of arithmetic that is most commonly presented in textbooks. 1. First one introduces Euclid's algorithm,

20 Dec 2018: Coding and Cryptography. T. W. Körner. December 20, 2018. Transmitting messages is an important practical problem. Coding theoryincludes the study of compression codes which enable us to send messagescheaply and error correcting codes which ensure

30 Aug 2022: Partial Solutions for Exercises inNaive Decision Making. T. W. Körner. 1. 2. Introduction. Here is a miscellaneous collection of hints, answers, partial answersand remarks on some of the exercises in the book. I have writtenin haste in the hope

23 Apr 2016: Since K S, we have Ka Sa. On the other hand, ifb Sa then b L for some special chain L and each of the three possiblerelationships given in our key ... Thus Sa Ka, soSa = Ka and Sa is a special chain.).

16 May 2002: KA"C@=JDc3[.@]?KQ100"de_U=J Y?:557C1?f]Q@Dg5:.T3[0 2@= QB= 0"Q1?K3<hSi2T8:3U?:?:3NDj873k57.10"?:3k0lFW5:.T3bCT5:.T0 8m0"Q@Y ... E"Ū/¥¥]ª«E»4k«CB"«E/»]ªºP«eÄES/Wcª/)ÈÉSÄEªÅªHcª«E»4o"/«D7»]SÄEÁ«ÆµcFD7/»Ó"ªº"Wc«kÅ/Lc>«E

21 Oct 2004: Since K S, we have Ka Sa. On the other hand, ifb Sa then b L for some special chain L and each of the three possiblerelationships given in our key ... Thus Sa Ka, soSa = Ka and Sa is a special chain.).

11 Nov 2009: How to Write a Part III Essay. T. W. KörnerTrinity Hall. These unofficial notes replace an earlier set by Marj Batchelorwhich were becoming illegible through repeated photocopying. Manyof the key pieces of advice are taken almost word for word

16 May 2002: #"$&%(')-,/.0.013246587:9<;=)>?7:49=-@A+(B?CD?BE2F,G;=)IH1:>?4.A;J,LK

27 Nov 2012: So b′ = b ka is also in Λ and has. ... b′| = t′|a| < |a|. The choice of a tells us that b′ must be 0, so b = ka Za as required.

22 Jan 2024: ρp(k,2k 1) =. aQp/(Qp)2P2k1(d(Q) = (1)ka,c(Q) = (1,a)k);. ρp(k,2k 2) = 1P2k2(d(Q) = (1)k1,c(Q) = 1). ... This gives four Qp-equivalence classes of forms, with invariants d(Q) = (1)ka andc(Q) = (1,a)k.