8. (Section 1.3 #10) Let p be an integer other than 0, ±1. Prove p is...

8. (Section 1.3 #10) Let p be an integer other than 0, ±1. Prove p is prime if and only if for all a 2 Z
either (a, p) = 1 OR p | a.
9. (Section 1.3 #16) Prove that (a, b) = 1 if and only if there is no prime p such that p | a AND p | b.

Expert Solution

8.

“a” be an integer which is not divisible by a. and p is prime. The only common divisors of a are −1 and 1and the only divisors of p are −1, 1, −p, p. Therefore (a, p) = 1. Since this argument works for every integer which does not divisible by p, we have for every integer a that either p|a or (a, p) = 1.

If suppose that p ∈ Z and for every a ∈ Z, either (a, p) = 1 or p|a. Suppose if p is not prime then p has a divisor a such that a is not equal to −1, 1, p, −p. If a is a divisor then −a is a divisor, we may choose a to be positive; thus we have a divisor a such that 1 < a < p. According to our hypothesis, either (a, p) = 1 or p|a. Since 0 < a < p, p cannot divide a. Since a is a common divisor of a and p, (a, p) > a > 1. This is a contradiction. Therefore, p must be prime.

9.

The only common divisors of a and b are +1 and -1 if (a, b) = 1, neither of which is prime. If there are no common divisors other than ±1; for if c is not equal to ±1 were a common divisor of a and b, then c would be a product of primes, say c = p1 . . . pn, and since p1|c, we would have that p1|a and p1|b, which contradicts (a, b) = 1.

milcah answered 2 years ago

Let p be an integer other than 0, ±1. (a) Prove that p is prime if...

Let p be an integer other than 0, ±1. (a) Prove that p is prime if and only if it has the property that whenever r and s are integers such that p = rs, then either r = ±1 or s = ±1. (b) Prove that p is prime if and only if it has the property that whenever b and c are integers such that p | bc, then either p | b or p | c.

8.Let a and b be integers and d a positive integer. (a) Prove that if d...

8.Let a and b be integers and d a positive integer. (a) Prove that if d divides a and d divides b, then d divides both a + b and a − b. (b) Is the converse of the above true? If so, prove it. If not, give a specific example of a, b, d showing that the converse is false. 9. Let a, b, c, m, n be integers. Prove that if a divides each of b and c,...

(a) Let a > 1 be an integer. Prove that any composite divisor of a −...

(a) Let a > 1 be an integer. Prove that any composite divisor of a − 1 is a pseudoprime of base a. (b) Suppose, for some m, than n divides a^(m − 1) and n ≡ 1 (mod m). Prove that if n is composite, then n is a pseudoprime of base a. (c) Use (b) to give two examples pseudoprimes of base a with a = 2 and a = 3 (hint: take m = 2k to be...

Suppose a is a positive integer and p is a prime/ Prove that p|a if and...

Suppose a is a positive integer and p is a prime/ Prove that p|a if and only if the prime factorization of a contains p. Can someone please show a full proof to this, thank you.

4. Let n ≥ 8 be an even integer and let k be an integer with...

4. Let n ≥ 8 be an even integer and let k be an integer with 2 ≤ k ≤ n/2. Consider k-element subsets of the set S = {1, 2, . . . , n}. How many such subsets contain at least two even numbers?

11.4 Let p be a prime. Let S = ℤ/p - {0} = {[1]p, [2]p, ....

11.4 Let p be a prime. Let S = ℤ/p - {0} = {[1]p, [2]p, . . . , [p-1]p}. Prove that for y ≠ 0, Ly restricts to a bijective map Ly|s : S → S. 11.5 Prove Fermat's Little Theorem

a. Let A be a square matrix with integer entries. Prove that if lambda is a...

a. Let A be a square matrix with integer entries. Prove that if lambda is a rational eigenvalue of A then in fact lambda is an integer. b. Prove that the characteristic polynomial of the companion matrix of a monic polynomial f(t) equals f(t).

Prove the following statements! 1. Let S = {0, 1, . . . , 23} and...

Prove the following statements! 1. Let S = {0, 1, . . . , 23} and define f : Z→S by f(k) = r when 24|(k−r). If g : S→S is defined by (a) g(m) = f(7m) then g is injective and (b) g(m) = f(15m) then g is not injective. 2. Let f : A→B and g : B→C be injective. Then g ◦f : A→C is injective. 3. Let f : A→B and g : B→C be surjective....

If p,p+2 are twin primes, prove 4((p−1)!+1)+p≡0 modp(p+2)

Let Bt be a 1-dimensional Brownian motion and let c > 0 be a constant. Prove...

Let Bt be a 1-dimensional Brownian motion and let c > 0 be a constant. Prove that is also a Brownian motion.

Question