Math 139 Fourier Analysis Lecture 33: Elementary Number Theory

Thanks! Share it with your friends!

You disliked this video. Thanks for the feedback!

Added by admin
242 Views
Euclid's algorithm. Divisors; prime numbers; greatest common divisor; relatively prime. The greatest common divisor lies in the span of the numbers; characterization of relative prime-ness; Fundamental Theorem of Arithmetic (unique factorization into primes); Euclid's proof of the infinitude of primes. Infinite products. Condition implying the convergence of an infinite product.
Category
number theory Mahematics
Tags
number theory, math

Post your comment

Comments

Be the first to comment