JK Contradance calling
L0 Contradance program
L1 Contradance program
L2 Contradance program
L3 Contradance program
L4 Contradance program
L5 Contradance program
Michael Dyck's Contradance Index
Footnote, good books
SeLo 2020t, both sections
MHF3202 3E06 (17450) Sets.&.Logic MWF4 [10:40-11:30] Lit235
MHF3202 1503 (27231) Sets.&.Logic MWF4 [10:40-11:30] ONLINE
Sets and Logic
Our Teaching Page
has useful information for students in all of my classes.
It has my schedule,
and Usually Useful Pamphlets.
One of them is the
which gives pointers on what I consider to be good mathematical
Further information is at our
(I email this private URL directly to students).
Mastery of Zoom.
are like nitroglycerin, in that one little mis-step leads to the whole
thing blowing up in your face.
There is no partial credit when it comes to Explosives and Quantifiers.
Please take a gander at
Past courses with notes, exams and links.
- SeLo syllabus (in progress)
- Current assignment:
Memorize the Math-Greek alphabet (pdf).
- Current assignment:
Become comfortable reading/writing
(up through “Equivalent predicates...”).
- Current assignment: Peruse the challenging
Problem List for SeLo (pdf).
It has hyperlinks in the
Table-of-Contents and the Index.
- Current assignment: Peruse
Does Zero = One? (pdf).
Here are some
proofs poofs about which
you can post to our Archive.
- Near Future:
The Euclidean algorithm can be conveniently applied in table-form; I
call this form “Lightning Bolt ”
because the update-rule looks like a lightning-bolt (used thrice).
Lightning-bolt algorithm (pdf),
learning the algorithm, but skipping the proofs.
Print out on paper (yes, actual paper), the
practice sheet for LBolt (pdf)
and fill-in the tables. This type of question for the first exam, Sept.30, so you
A std proof of the
Inclusion-Exclusion principle (pdf),
with Candy-Store, Derangement and Stirling-number examples.
W: Euclidean algorithm
(up through “Extended Euclidean...” but skip the proofs)
W: Modular arithmetic
The first page of
Algorithms in Number Theory (pdf),
uses LBolt iteratively to compute the GCD of a list of integers,
together with its list of Bézout multipliers.
Page 2 uses LBolt to solve linear congruences:
Find all x where 33x is mod-114 congruent to 18.
- Distant future:
Our Primer on cardinality.
- The famous
On-line Encyclopedia of Integer Sequences, and
W: OEIS history, and a
video with a challenge at the end.
Everybody loves the Euler-Fermat thm.
Using EFT to solve
10270 + 1 =113= b37
(txt), from Prof. William Stein's book.
Fun, challenging problems:
JK Home page