Goto: Prof. King's page at Univ. of Florida.
Or: JK Homepage.

Modified:
Tuesday, 02Aug2016
Printed:
Saturday, 24Jun2017

Page:
http://squash.1gainesville.com/Include/thispage.shtml

See the Teaching Page for Usually Useful Pamphlets.

Combinatorics II , will start with the clever notion of Generating Functions.

Number Theory & Cryptography . This course is an introduction to coding theory in general, and Mathematical Cryptography in particular. It does not assume a previous Number Theory course, only asking that the student do a bit of reading before the semester begins. (The webpage has a few suggestions.)

Combinatorics I , with many methods of counting. Note: I give test of prerequisite knowledge during Add/Drop. A practice exam is on our webpage.

Calculus III Careful treatment of multi-dimensional calculus. Note: I give test of prerequisite knowledge during Add/Drop. Our webpage has a practice exam.

Euclidean Geometry. A proof-based course covering a superset of: Theorems on Triangles (centroid, in-center, circum-center, ortho-center, Euler-line, Simson-Line), circles (Central-angle thm, Power-of-a-point), ruler/straightedge contructions and dissections of polygons. Matrix multiplication will be introduced for easy descriptions of transformations preserving Euclidean theorems. Time permitting, elem. Projective Geometry will be introduced, since many PG thms are also EG thms.

Sets and Logic. Helps students to read and produce proofs, and learn the basic language of modern Mathematics. There was a test of prerequisite knowledge on Wedn, 11Jan.; our webpage has a practice exam.

(theoretical) Linear Algebra. Matrices, determinants, Gauss-Jordan algorithm, eigenvalues/vectors, matrix diagonalization, various matrix decompositions.

Sets and Logic . Helps students to read and produce proofs, and learn the basic language of modern Mathematics.

Modern Analysis II . The continuation of a full-year course in Real Analysis. Time permitting, we will learn some Ergodic Theory (dynamical systems) this semester. Its undergrad number is

Number Theory & Mathematical Cryptography: [

Modern Analysis I . A full-year course in Real Analysis. It uses the highly-regarded

Baby Rudintext. Time permitting, I hope to discuss a bit of Ergodic Theory (dynamical systems) in the 2

(Abstract) Linear Algebra .

Calculus II . Careful treatment of 1-dimensional calculus, with emphasis on Taylor's theorem and Taylor series.

Ergodic Theory

Ergodic Theory

Sets and Logic . Helps students to read and produce proofs, and learn the basic language of modern Mathematics.

Advanced Calculus for Engineers and (Physical) Scientists [ACES] Introductory Real Analysis on Euclidean Spaces. One might say that it is

Advanced Calculus (Theoretical) [ACT] Introductory Real Analysis on Metric Spaces. For students who plan to do graduate work in mathematics, this is the AdvCalc course to take.

Abstract Algebra 1 . An introduction to

Sets and Logic . Helps students to read and produce proofs, and learn the basic language of modern Mathematics.

Number Theory & Elliptic Curve Cryptography
is an undergraduate Special Topics course which is also appropriate for
graduate students who have not had extensive Number Theory.
This course does **not** require
MAS4203 as prerequisite. All that is necessary is some
preparatory reading
from a free online NT text.
What we cover will be partly determined by *students' interests*.

The central theme is Number Theory and codes of various kinds:
Diffie-Hellman protocol,
Huffman coding,
Ziv-Lempel,
Meshalkin isomorphism code,
Elliptic Curve Codes.
We will discuss various algorithms, such as
*repeated-squaring*,
and Shank's
*Baby-step Giant-step* method for computing a Discrete logarithm.

Computational Linear Algebra . Matrices, determinants, Gauss-Jordan algorithm, eigenvalues/vectors, matrix diagonalization, various matrix decompositions.

My section of this course will have a **test of prerequisite
knowledge** on
Monday, 27Aug2007.
The course webpage has a *Sample Exam*.

Number Theory 1, of Spring 2007. Modular arithmetic, Chinese Remainder Thm, Legendre/ Jacobi symbols, Quadratic reciprocity, Fermat's SoTS thm, Lagrange 4-square thm, basic cryptography (Diffie-Hellman, RSA). Assumes no previous knowledge of Number Theory.

Computational Linear Algebra . Matrices, determinants, Gauss-Jordan algorithm, and various matrix decompositions.

Number Theory 2 & Cryptography: A continuation of my NT1 with an emphasis on Mathematical Cryptography. Course NT1 is

Advanced Calculus This is an introductory Real Analysis course. One might say that it is "Calculus done right", with rigorous definitions and proofs. If time permits, we'll do an introduction to Metric Spaces.

Introduction to Number Theory, 1 , Spring 2006. This course is an introduction to elementary number theory. It assumes no previous knowledge of number theory.

Numbers & Polynomials . Textbook:

Moore Method, meaning that students prove all theorems, with enlightened guidance from the Professor.

(theoretical) Linear Algebra . MAS4105.

Abstract Algebra 1 An introduction to Groups, Rings and Fields.

For the academic year Autumn 2004 through Spring 2005 I was on Research Leave.

Prof. King will be on Research Leave for Autumn2004-Spring2005 and will not be teaching. (He does plan to be present!, working on a writing project.)

Probability & Potential Theory 2 MAP6473 MWF 7 in FLO100. (Griffin-Floyd Hall.)

Elementary Differential Equations MAP2302 section 3145 : Beginning differential eqns for the bright, motivated, hard-working student.

Probability & Potential Theory 1 MAP6472 MWF2 in LIT217.

Abstract Algebra 1 An introduction to Groups, Rings and Fields.

Elementary Differential Equations Beginning differential eqns for the bright, motivated, hard-working student.