The most difficult concept in this reading section is the understanding of the definitions of the divisor, and the application points of prime numbers. I had to do a few simple example problems to convince myself of the fact of the Fundamental theorem of Arithmetic to verify that the statement was true. It helped to notice that the definition of p being prime is true if and only if -p is also prime!
I really enjoy the Euclidian algorithm, and using it to find (a,b) or the greatest common divisor. It is also very useful in knowing and applying understanding for prime numbers. I'm excited to use these concept to describe modular arithmetic and building on these principles.
No comments:
Post a Comment