Source: Lecture Notes | Theory of Numbers | Mathematics | MIT OpenCourseWare

# career

# Syllabus | Theory of Numbers | Mathematics | MIT OpenCourseWare

This course is an elementary introduction to number theory. Topics to be covered include: Primes, Divisibility and the Fundamental Theorem of Arithmetic Greatest Common Divisor (GCD), Euclidean Algorithm Congruences, Chinese Remainder Theorem, Hensel’s Lemma, Primitive Roots Quadratic Residues and Reciprocity Arithmetic Functions, Diophantine Equations, Continued Fractions,

Source: Syllabus | Theory of Numbers | Mathematics | MIT OpenCourseWare

# Codimension – Wikipedia

If W is a linear subspace of a finite-dimensional vector space V, then the codimension of W in V is the difference between the dimensions:

Source: Codimension – Wikipedia

# The Farey-Ford tessellation and circle packing

For every such rational number p/q, draw a circle Cp/q of diameter 1/q2 that touches the x-axis exactly at p/q, and sits above this x-axis.

# Euclidean Algorithm — from Wolfram MathWorld

# Harold Davenport – The Higher Arithmetic

Harold Davenport – The Higher Arithmetic

# Diophantine – Google Search

In mathematics, a Diophantine equation is a polynomial equation, usually in two or more unknowns, such that only the integer solutions are sought or studied (an integer solution is a solution such that all the unknowns take integer values).

Source: Diophantine – Google Search