��1�¡��M�φ��}�c�M�ϼ��g(sh��)��Փ111��������ɕr�g�Ć��}212��ƥ�䆖�}1013���������}1614���㷨����Ч��23�vʷעӛ35�a����(x��)�}37Ӌ��C�}39���]�x��40��2�¡����ϡ��P(gu��n)ϵ�ͺ���(sh��)4121�������\��4122���ȃr�P(gu��n)ϵ47*23��ƫ���P(gu��n)ϵ5424������(sh��)6525����(sh��)�W(xu��)�w�{��7626����(y��ng)��84�vʷעӛ93�a����(x��)�}95Ӌ��C�}98���]�x��98��3�¡����a��Փ9931��ͬ��10032���W������㷨10633��RSA����11334���z�e�a�ͼm�e�a12235����ꇴa13236���μm�e��ꇴa140�vʷעӛ147�a����(x��)�}149Ӌ��C�}152���]�x��153��4�¡��D15441���D�����ʾ15442��ͨ·�ͻ�·16443��*��ͨ·�;��x18144���D��ɫ19345������D��������؈D202�vʷעӛ219�a����(x��)�}220Ӌ��C�}226���]�x��227��5�¡���22851��������|(zh��)22852�����ɘ�23853����ȃ�(y��u)������25354������26655�������ͱ�v27456��*��(y��u)�����Ͷ���������287�vʷעӛ306�a����(x��)�}308Ӌ��C�}311���]�x��312��6�¡�ƥ��31361���ஐ����ϵ31362���D�е�ƥ��31963��ƥ���㷨32764���㷨�đ�(y��ng)��33765������������346�vʷעӛ354�a����(x��)�}355Ӌ��C�}357���]�x��357��7�¡��W(w��ng)�j(lu��)��35871�����͸�35872�������V�㷨36973��*����*С���38274������ƥ��389�vʷעӛ397�a����(x��)�}397Ӌ��C�}400���]�x��401��8�¡�Ӌ��(sh��)���g(sh��)40281����˹�������κͶ��ʽ����40282��3������ԭ��40683�����кͽM��41684�����S�؏�(f��)�����кͽM��42185������428*86���ݳ�ԭ��434*87�����к�r�M�ϵ�����445�vʷעӛ452�a����(x��)�}453Ӌ��C�}456���]�x��457��9�¡��f���P(gu��n)ϵ�c���ɺ���(sh��)45891���f���P(gu��n)ϵ45892��������47093����ϵ��(sh��)���Բ�ַ���482*94�����f���P(gu��n)ϵ�����㷨��Ч��49495�������ɺ���(sh��)Ӌ��(sh��)50696�����ɺ���(sh��)�Ĵ���(sh��)513�vʷעӛ523�a����(x��)�}524Ӌ��C�}527���]�x��528��10�¡��M���·�����ޠ�B(t��i)�C529101��߉݋�T529102����(g��u)��M���·538103�����Z�D546104�����ޠ�B(t��i)�C560�vʷעӛ569�a����(x��)�}570Ӌ��C�}573���]�x��573���A��߉݋���C������574A1�����}��“(li��n)�Y(ji��)�~574A2��߉݋�ȃr583A3���C���ķ���587�vʷעӛ593�a����(x��)�}594���]�x��596���B�����597�vʷעӛ604���C�������е��㷨607�����īI613�攵(sh��)̖��(x��)�}��618�DƬ��Դ658Contents1AN INTRODUCTION TO COMBINATORIAL PROBLEMS AND TECHNIQUES111 The Time to Completea Project 212 A Matching Problem 1013 A Knapsack Problem 1614 Algorithms and Their Efficiency 23Historical Notes 35Supplementary Exercises 37Computer Projects 39Suggested Readings 402 SETS, RELATIONS, AND FUNCTIONS 4121 Set Operations 4122 Equivalence Relations 4723* Partial Ordering Relations 5424 Functions 6525 Mathematical Induction 7626 Applications 84Historical Notes 93Supplementary Exercises 95Computer Projects 98Suggested Readings 983 CODING THEORY 9931 Congruence 10032 The Euclidean Algorithm 10633 The RSA Method 11334 Error-Detecting and Error-Correcting Codes 12235 Matrix Codes 13236 Matrix Codes that Correct All Single-Digit Errors 140Historical Notes 147Supplementary Exercises 149Computer Projects 152Suggested Readings 1534 GRAPHS 15441 Graphs and Their Representations 15442 Pathsand Circuits 16443 Shortest Paths and Distance 18144 Coloringa Graph 19345 Directed Graphs and Multigraphs 202Historical Notes 219Supplementary Exercises 220Computer Projects 226Suggested Readings 2275 TREES 22851 Properties of Trees 22852 Spanning Trees 23853 Depth-First Search 25354 Rooted Trees 26655 Binary Trees and Traversals 27456 Optimal Binary Trees and Binary Search Trees 287Historical Notes 306Supplementary Exercises 308Computer Projects 311Suggested Readings 3126 MATCHING 31361 Sys