Need help in determining the following proof exercise. (See attached file for full problem description) --- 4. Let f:Z+ --> Z be the function defined by... ---
1. Let d; a; b; r, and q be integers. a) Suppose that d|a and d|b. Show that d|(ra + qb). b) Suppose a = qb + r. Show that the set of common divisors of a and b is the set of common divisors of b and r.
1. Let a, b be positive integers, and write a = qb + r, where q, r are Elements of Z and 0 (= or)< r < b. Suppose that d = gcd(a, b). a) If r = 0 show that d = b. b) If r > 0 show that d = gcd(b, r). 4. Use Problem 1 to find: a) gcd(100; 3); b) gcd(100; 82).
Let p and a be positive integers and suppose that p|a2. a) Show that p|(ra + sp)2 for all integers r; s. b) Use part a), the definition of prime integer, and Theorem 15.1.1 to construct a proof by induction that p|a. [Hint: If a (< or =) p consider p = qa + r, where 0 (< or =) r < a. If p < a consider a = qp + r, where 0 (< ...continues
please give the missing digit : it is a three by three puzzles, the first row has a 9and 7 ,but missing a first number, the second row has a 4, missing the first and third number and the last row is empty. the second thre by three square has a 3 in the first row,second row is empty, and third row has a 7 in the first box and ...continues
(See attached file for full problem description)
(See attached file for full problem description WITH PROPER EQUATIONS AND SYMBOLS) --- The idea of this problem is to investigate solutions to x2≡1(mod pq) where p and q are distinct odd primes. (a) Show that if p is an odd prime, then there are exactly two solutions modulo p to x2≡1(mod p). (b) Find all pair ...continues
For Every Integer Prove Not Prime
Show that for every positive integer n, 8n+1 is not prime.
An integer n is called k-perfect if σ(n) = kn (note that a perfect number is 2-perfect). (a) Show that 120 = 23• • • 3 • • • 5 is 3-perfect. (b) Show that if n is 3-perfect and gcd(3, n) = 1, then 3n is 4-perfect.
In order to solve the congruence 2x + 6 ≡ 4 (mod 8), your friend Phil Lovett wrote down the following steps: 2x+6 ≡ 4 (mod 8) x+3 ≡ 2 (mod8) x ≡ −1 (mod 8) From here, Phil concludes that the solution set to 2x + 6 ≡ 4 (mod 8) is {x; x ≡ −1 (mod 8)}. (a) Is Phil’s ...continues
