A diagrammatic approach to invariants of knots is the focus. Connections with graph theory, physics, and other topics are included, along with an explanation of how proofs of some old conjectures about alternating knots emerge from this work. (MNS)

Discussed is the tendency of students to equate the concepts of continuity and connected graphs based on their lack of an understanding of such concepts as limit points, closed sets, and connected sets. Included is a theorem with three lemmas with their proofs. (KR)

Presented is a method of interchanging the x-axis and y-axis for viewing the graph of the inverse function. Discussed are the inverse function and the usual proofs that are used for the function. (KR)

Discussed are the vital properties that an operator must have to be called a derivative and how derivatives work. Presented is an extension of the derivative that uses least squares to find the line of best fit. (KR)

Presented are two exercises on the differential geometry of curves. A generalization dealing with smoothness conditions is given that relates the two exercises. Included are the definitions, theorems, propositions, and proofs. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)