Prove the following:
1. Let a, b and c be integers. Prove if a|b and b|c then a|c.
2. if a|b and a|c then a|bx + cy for all integers x and y
3. Let a, b and c be integers with a > 1. Prove if a|b and a|c then a does not divide bc + 1.
4. Prove that every integer larger than 1 can be expressed as the product of prime numbers.
5. If a = qb + r then gcd(a, b) = gcd(b, r).
6. Show that gcd(a, b) = 1 if and only if there exist x, y, ∈ Z such that ax + by = 1. (Think GCD Characterization theorem)
7. Prove for integers a, b and c, that if a|bc and gcd(a, b) = 1 then a|c.
8. Prove if a, b, c are integers with gcd(a, b) = 1 and c|(a+b) then gcd(c, a) = 1 and gcd(c, b) = 1.

Solution PreviewSolution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

Advanced Math Proofs
    $50.00 for this solution

    PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

    Find A Tutor

    View available Advanced Math Tutors

    Get College Homework Help.

    Are you sure you don't want to upload any files?

    Fast tutor response requires as much info as possible.

    Upload a file
    Continue without uploading

    We couldn't find that subject.
    Please select the best match from the list below.

    We'll send you an email right away. If it's not in your inbox, check your spam folder.

    • 1
    • 2
    • 3
    Live Chats