Skip to Main Content

Math

mas 4203 banner

Number Theory- Proof by Induction

Operations in Base 2 (binary)

Converting from Base-2 (binary) to Base-8 (octal)

Accessing the int( Feature on a TI-84 (floor function)

The Division Algorithm

Number Theory- Converting from Base 2 to Base 16

Number Theory- Prime and Composite Numbers

Polygonal Numbers

Sieve of Erathosthenes

The Greatest Common Divisor

The Euclidean Algorithm

Linear Combinations

Canonical Decomposition

Fermat Factorization

Congruence Classes

Modular Arithmetic

Modular Inverses

Using Congruences to find Remainders for Large Values

Determining Divisibility by 13

Testing for Divisibility by 11

Number Theory- Testing for Divisibility by 7 (method 1)

Testing for Divisibility by 7 (method 2)

Casting out Nines Technique

Wilson's Theorem

Fermat's Little Theorem

Summation Notation

Product Notation

Closure Properties

The Chinese Remainder Theorem