notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

GCD.md (255B)


      1 # GCD
      2 
      3 U 2.4
      4 
      5 **Definition:** The GCD of two numbers a and c is the largest integer such that a | b and a | c.
      6 
      7 To find the GCD of two numbers find the prime factorization and then take the min exponent of each prior prime. Evaluate this to find the GCD.