*2. in the correctness of the euclid's algorithm, we need to prove
that rm is indeed a greatest common divisor of a and b. this
can be done by proving
(a) r'm divides a and b, and
(b) any integer which divides both a and b also divides rm.
proof that the above two statements are correct.

Idon understand these and need some ! ?

Alex’s family members live in different parts of the world. they would like to discuss the wedding plans of one of their distant relatives. however, alex wants all the family members to talk to each other simultaneously so that they can make decisions quickly. which mode of internet communication should they use? a. blog b. email c. wiki d. message board e. instant messaging

People with high self-esteem: accept their strengths and weaknesses. believe that failed experiences are failures of their whole self. feel good about who they are only when they reach total success. need positive external experiences to counteract negative feelings that constantly plague them.