User Tools

Site Tools


math104-s21:s:vpak

This is an old revision of the document!


Hi here is my note page.

Summary of Material

1. Numbers, Sets, and Sequences

Rational Zeros Theorem. For polynomials of the form cnxn + … + c0 = 0 , where each coefficient is an integer, then the only rational solutions have the form cd\frac{c}{d} where c divides cn and d divides c0; rational root r must divide c0.

The maximum of a set S is the largest element in the set. The minimum is the smallest element in the set. The inf\inf of S is the greatest lower bound. The sup\sup of S is the smallest upper bound. S is bounded if \foralls \in S, s\leqM for some M \in R\reals Completeness Axiom. If S is a nonempty bounded set in R\reals, then inf\inf S and sup\sup S exist. Archimedean Property. If a, b >\gt 0, then \existsn such that na >\gt b.

math104-s21/s/vpak.1620441127.txt.gz · Last modified: 2021/05/07 19:32 by 68.186.63.173