CS 173 Study Guide - Quiz Guide: Pseudocode, Euclidean Algorithm, Rational Number
16 Sep 2016
School
Department
Course
Professor
Document Summary
Special cases for divides: zero is even zero divides itself but not any other integer every integer divides zero. Prime numbers, factoring a number into primes numbers >= 2. Special cases for prime: 0 and 1 are not primes. Know the definitions of gcd(a,b) and lcm(a,b) able to compute gcd(a,b) and lcm(a,b) for small a, b. Write any small positive integer as a product of primes sqrt(2) is not a rational. Any positive integer can be written as the product of primes and each integer has only one prime factorization aside from the order of representation. Define what it means for x and y to be congruent mod k. Compute the gcd of two larger numbers using euclidean algorithm. Compute the gcd of two larger numbers using euclidean algorithm create it"s pseudocode. Prove simple number theory claims using direct proof and the definitions of the terms involved. Ex. if a divides b, and a divides c, then a divides b+c.
