7.0

Topic 7.0

1.  Every number can be decomposed into a product of primes. 84=2²*3¹*5⁰*7¹*11⁰*13⁰*17⁰.,,

2.  Greatest common divisor gcd(x, y)=2^min(j0,k0)*3^min(j1,k1)*5^min(j2,k2)*…

Least common multiple   lcm(x,y)= 2^max(j0,k0)*3^max(j1,k1)*5^max(j2,k2)*…

gcd(x,y) * lcm(x,y)=xy; 

3.  Check for Primality:

1)  Method 1: Iterate up through the square root of n

2)  Method 2: Only check is n is divisible by a prime number.  

4.  Generating a List of Primes: The Sieve of Eratosthenes.

To optimize: only use odd numbers in the array—reduce our space usage by half.