Question

1. (a) Let a, b and c be positive integers. Prove that gcd(ac, bc) = c...

1. (a) Let a, b and c be positive integers. Prove that gcd(ac, bc) = c x gcd(a, b). (Note that c gcd(a, b) means c times the greatest common division of a and b)

(b) What is the greatest common divisor of a − 1 and a + 1? (There are two different cases you need to consider.)

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
4. Let a, b, c be integers. (a) Prove if gcd(ab, c) = 1, then gcd(a,...
4. Let a, b, c be integers. (a) Prove if gcd(ab, c) = 1, then gcd(a, c) = 1 and gcd(b, c) = 1. (Hint: use the GCD characterization theorem.) (b) Prove if gcd(a, c) = 1 and gcd(b, c) = 1, then gcd(ab, c) = 1. (Hint: you can use the GCD characterization theorem again but you may need to multiply equations.) (c) You have now proved that “gcd(a, c) = 1 and gcd(b, c) = 1 if and...
8. Let a, b be integers. (a) Prove or disprove: a|b ⇒ a ≤ b. (b)...
8. Let a, b be integers. (a) Prove or disprove: a|b ⇒ a ≤ b. (b) Find a condition on a and/or b such that a|b ⇒ a ≤ b. Prove your assertion! (c) Prove that if a, b are not both zero, and c is a common divisor of a, b, then c ≤ gcd(a, b).
Write a program called gcd that accepts two positive integers in the range of [32,256] as...
Write a program called gcd that accepts two positive integers in the range of [32,256] as parameters and prints the greatest common divisor (GCD) of the two numbers. The GCD of two integers a and b is the largest integer that is a factor of both a and b. One efficient way to compute the GCD of two numbers is to use Euclid’s algorithm, which states the following: GCD (a, b) _ GCD (b, a % b) GCD (a, 0)...
Suppose a,b,c belong to Z and gcd(b,c) = 1 . Prove that if b/(ac), then b/a.
Suppose a,b,c belong to Z and gcd(b,c) = 1 . Prove that if b/(ac), then b/a.
9. Let a, b, q be positive integers, and r be an integer with 0 ≤...
9. Let a, b, q be positive integers, and r be an integer with 0 ≤ r < b. (a) Explain why gcd(a, b) = gcd(b, a). (b) Prove that gcd(a, 0) = a. (c) Prove that if a = bq + r, then gcd(a, b) = gcd(b, r).
Prove that for positive integers a and b, gcd(a,b)lcm(a,b) = ab. There are nice proofs that...
Prove that for positive integers a and b, gcd(a,b)lcm(a,b) = ab. There are nice proofs that do not use the prime factorizations of a and b.
Let a, b, and c be integers such that a divides b and a divides c....
Let a, b, and c be integers such that a divides b and a divides c. 1. State formally what it means for a divides c using the definition of divides 2. Prove, using the definition, that a divides bc.
Prove: P(A ∪ B ∪ C) = P(A) + P(Ac ∩ B) + P(Ac ∩ Bc...
Prove: P(A ∪ B ∪ C) = P(A) + P(Ac ∩ B) + P(Ac ∩ Bc ∩ C)
use the fundamental theorem of arithmetic to prove: if a divides bc and gcd(a,b)=1 then a...
use the fundamental theorem of arithmetic to prove: if a divides bc and gcd(a,b)=1 then a divides c.
The greatest common divisor c, of a and b, denoted as c = gcd(a, b), is...
The greatest common divisor c, of a and b, denoted as c = gcd(a, b), is the largest number that divides both a and b. One way to write c is as a linear combination of a and b. Then c is the smallest natural number such that c = ax+by for x, y ∈ N. We say that a and b are relatively prime iff gcd(a, b) = 1. Prove that a and n are relatively prime if and...