Go Back to 618-251 (Mathematics, Faculty of Science, v4, p211)
NOTE: These differences were detected by computer program - they may or may not be substantive.
Different CONTACT
Source=[39 lectures (three a week)]
Xref = [39 lectures (three each week)]
Different CONTENT
Source=[The natural numbers: well-ordering, forms of mathematical induction, division algorithm, greatest common divisor, prime factorization, recursion. Combinatorics: graphs and trees, paths, cycles, counting principles. Logic: logical notation, propositional connectives, quantifiers, truth tables, logical validity, counter-examples, methods of proof. Set theory: sets and set operations, functions, relations, orderings, equivalence relations and partitions, cardinality, countable and uncountable sets. Additional topics selected from: difference equations, generating functions, graph theory.]
Xref = [<i>The natural numbers</i> Well-ordering, forms of mathematical induction, division algorithm, greatest common divisor, prime factorization, recursion. <i>Combinatorics</i> Graphs and trees, paths, cycles, counting principles. <i>Logic</i> Logical notation, propositional connectives, quantifiers, truth tables, logical validity, counter-examples, methods of proof. <i>Set theory</i> Sets and set operations, functions, relations, orderings, equivalence relations and partitions, cardinality, countable and uncountable sets. <i>Additional topics selected from:</i> Difference equations, generating functions, graph theory.]
Different OBJECTIVES
Source=[On completion of this subject, students should:
<p><i>Comprehend:</i></p>
<ul>
<li>the notion of validity of a mathematical formula
<li>the concept of a mathematical proof
<li>the principle of mathematical induction
<li>the use of logical notation
<li>countability and uncountability
</ul>
<p><i>Have developed:</i></p>
<ul>
<li>skills and experience in using the language of sets, functions and relations
<li>skills in counting and combinatorics
<li>elementary skills in analysing graphs
<li>the ability to prove simple theorems properly
<li>skills in proving results by mathematical induction.
</ul>
<p><i>Appreciate:</i></p>
<ul>
<li>the need for mathematical rigour
<li>the variety of applications of discrete mathematical techniques
</ul>]
Xref = [On completion of this subject, students should:
<p><i>Comprehend:</i></p>
<ul>
<li>the notion of validity of a mathematical formula;
<li>the concept of a mathematical proof;
<li>the principle of mathematical induction;
<li>the use of logical notation;
<li>countability and uncountability.
</ul>
<p><i>Have developed:</i></p>
<ul>
<li>skills and experience in using the language of sets, functions and relations;
<li>skills in counting and combinatorics;
<li>elementary skills in analysing graphs;
<li>the ability to prove simple theorems properly;
<li>skills in proving results by mathematical induction.
</ul>
<p><i>Appreciate:</i></p>
<ul>
<li>the need for mathematical rigour;
<li>the variety of applications of discrete mathematical techniques.
</ul>]
Different POINTS
Source=[12]
Xref = [12.0]
Mon Oct 9 16:30:34 1995
Generated by: ./S50-v2writeHTML.pl
What this report means.